E-COM-NET
首页
在线工具
Layui镜像站
SUI文档
联系我们
推荐频道
Java
PHP
C++
C
C#
Python
Ruby
go语言
Scala
Servlet
Vue
MySQL
NoSQL
Redis
CSS
Oracle
SQL Server
DB2
HBase
Http
HTML5
Spring
Ajax
Jquery
JavaScript
Json
XML
NodeJs
mybatis
Hibernate
算法
设计模式
shell
数据结构
大数据
JS
消息中间件
正则表达式
Tomcat
SQL
Nginx
Shiro
Maven
Linux
leedcode
[
leedcode
28] Implement strStr()
Implement strStr(). Returns the index of the first occurrence of needle in haystack, or -1 if needle is not part of haystack. public class Solution { public int strStr(String haystack, String
·
2015-10-23 09:56
code
[
leedcode
27] Remove Element
Given an array and a value, remove all instances of that value in place and return the new length. The order of elements can be changed. It doesn't matter what you leave beyond the new length. publ
·
2015-10-23 09:56
element
[
leedcode
29] Divide Two Integers
Divide two integers without using multiplication, division and mod operator. If it is overflow, return MAX_INT public class Solution { //本题很多细节需要考虑: //1.负数问题,见代码,很讨巧 //2.因为除法可以转换成减法,
·
2015-10-23 09:56
Integer
[
leedcode
24] Swap Nodes in Pairs
Given a linked list, swap every two adjacent nodes and return its head. For example,Given 1->2->3->4, you should return the list as 2->1->4->3. Your algorithm should use
·
2015-10-23 09:55
code
[
leedcode
25] Reverse Nodes in k-Group
Given a linked list, reverse the nodes of a linked list k at a time and return its modified list. If the number of nodes is not a multiple of k then left-out nodes in the end shou
·
2015-10-23 09:55
group
[
leedcode
23] Merge k Sorted Lists
/** * Definition for singly-linked list. * public class ListNode { * int val; * ListNode next; * ListNode(int x) { val = x; } * } */ public class Solution { //本题有两种解法,一
·
2015-10-23 09:54
merge
[
leedcode
22] Generate Parentheses
public class Solution { //卡特兰数,一共有C2n^n-C2n^n-1种组合数 //本题的递归非常经典,需要多看牢记 List<String> res; StringBuilder seq; public List<String> generateParenthesis(int n) {
·
2015-10-23 09:54
code
[
leedcode
19]Remove Nth Node From End of List
Given a linked list, remove the nth node from the end of list and return its head. For example, Given linked list: 1->2->3->4->5, and n = 2. After removing the second
·
2015-10-23 09:53
remove
[
leedcode
20] Valid Parentheses
Given a string containing just the characters '(', ')', '{', '}', '[' and ']', determine if the input string is valid. The brackets must close in the correct order,
·
2015-10-23 09:53
code
[
leedcode
18] 4Sum
Given an array S of n integers, are there elements a, b, c, and d in S such that a + b + c + d = target?
·
2015-10-23 09:53
code
[
leedcode
21] Merge Two Sorted Lists
/** * Definition for singly-linked list. * public class ListNode { * int val; * ListNode next; * ListNode(int x) { val = x; } * } */ public class Solution { public List
·
2015-10-23 09:53
merge
[
leedcode
15] 3Sum
public class Solution { public List<List<Integer>> threeSum(int[] nums) { //本题需要对重复数字进行考虑,主要涉及以下几处: //1.外层循环时,需要与前一个数进行比较,如果重复,使用 if 和continue //2.求target时,
·
2015-10-23 09:52
code
[
leedcode
14] Longest Common Prefix
public class Solution { public String longestCommonPrefix(String[] strs) { //求公共子序列,公共子序列必须是str[0]的子串,因此本题是将每一个字符串按位和第一个字符串的每一位进行比较 //如果发现不相匹配,则截取子串 //时间复杂度为O(m*n)m为最终求
·
2015-10-23 09:52
code
[
leedcode
17] Letter Combinations of a Phone Number
public class Solution { public List<String> res; public StringBuilder seq; public List<String> letterCombinations(String digits) { //本题类似于全排列的变形,全排列的每一位可选值需要根据传入的数字
·
2015-10-23 09:52
number
[
leedcode
16] 3Sum Closest
Given an array S of n integers, find three integers in S such that the sum is closest to a given number, target. Return the sum of the three integers. You may assume that
·
2015-10-23 09:52
close
[
leedcode
11] Container With Most Water
public class Solution { public int maxArea(int[] height) { /* 题意:二维坐标系里有 n 个点 (i, ai), ai >= 0,从 (i, ai)到(i, 0)划竖线,共有 n 条竖线。 找出两条竖线,使得它们构成的矩形的面积最大,矩形的高取决于最短的竖线。 思路:贪心
·
2015-10-23 09:51
contain
[
leedcode
10] Regular Expression Matching
Implement regular expression matching with support for '.' and '*'. '.' Matches any single character. '*' Matches zero or more of the preceding element. The matching should cover t
·
2015-10-23 09:50
[
leedcode
09]Palindrome Number
public class Solution { public boolean isPalindrome(int x) { //负数不是回文 //主要的突破点是如何获得整数的第n位和后n位(/和%运算结合) if(x<0)return false; int index=1; int temp=x
·
2015-10-23 09:50
number
[
leedcode
08]String to Integer (atoi)
public class Solution { public int myAtoi(String str) { //此题需要注意的细节很多 //1.对于“ -123”,“ +3231”,需要考虑去除最前的空格,主要利用循环 //2.对于越界情况需要判断(此题返回的是32位最大正数或32位最小负数),声明返回值时,需要声明为long
·
2015-10-23 09:49
Integer
[
leedcode
07]Reverse Integer
public class Solution { public int reverse(int x) { //此题需要注意整数越界问题,因此先将res声明为long,注意32位的范围是0x80000000到0x7fffffff long res=0; int flag=1; if(x<0) {
·
2015-10-23 09:49
Integer
[
leedcode
06]ZigZag Conversion
public class Solution { public String convert(String s, int numRows) { //本题通过画图numRows=4和numRows=5可以得到规则,主线路距离是2*numRows-2;辅助行是(numRows-i-1)*2 if(numRows<=1)return s;//注意判断
·
2015-10-23 09:48
conversion
[
leedcode
04]Median of Two Sorted Arrays
There are two sorted arrays nums1 and nums2 of size m and n respectively. Find the median of the two sorted arrays. The overall run time complexity should be O(log (m+n)). public
·
2015-10-23 09:47
Arrays
[
leedcode
5]Longest Palindromic Substring
public class Solution { public String longestPalindrome(String s) { //本题是动态规划思想,构造一个数组pal[i][j],表示从i到j是否为一个回文, //pal[i][j]=true;if i=j; //pal[i][j]=true 当 s[i]==s[j]并且
·
2015-10-23 09:47
substring
[
leedcode
03] Longest Substring Without Repeating Characters
Given a string, find the length of the longest substring without repeating characters. For example, the longest substring without repeating letters for "abcabcbb" is "abc", which t
·
2015-10-23 09:47
substring
[
leedcode
]Summary Ranges
双指针思路,循环时,声明一个变量保存范围起始的下标 注意:如何在数组只有一个元素,还有遍历到最后一个元素的时候,去更新结果集。 public class Solution { public List<String> summaryRanges(int[] nums) { List<String> res=new ArrayList<St
·
2015-10-23 09:46
code
[
leedcode
01] Two Sum
Given an array of integers, find two numbers such that they add up to a specific target number. The function twoSum should return indices of the two numbers such that they add up to the target, where
·
2015-10-23 09:46
code
[
leedcode
02] Add Two Numbers
You are given two linked lists representing two non-negative numbers. The digits are stored in reverse order and each of their nodes contain a single digit. Add the two numbers and return it as a link
·
2015-10-23 09:46
number
第三天--
leedcode
第三题
这是
leedcode
第三题的描述,简单来说就是给定一个字符串,找出这个字符串中最大的非重复子串的位置。
薛聚坡
·
2015-10-22 20:00
[
leedcode
144] Binary Tree Preorder Traversal
Given a binary tree, return the preorder traversal of its nodes' values. For example:Given binary tree {1,#,2,3}, 1 \ 2 / 3 return [1,2,3]. /*
·
2015-10-21 12:08
binary
[
leedcode
141] Linked List Cycle
Given a linked list, determine if it has a cycle in it. Follow up:Can you solve it without using extra space? /** * Definition for singly-linked list. * class ListNode { * int val; *
·
2015-10-21 12:08
list
[
leedcode
143] Reorder List
Given a singly linked list L: L0→L1→…→Ln-1→Ln,reorder it to: L0→Ln→L1→Ln-1→L2→Ln-2→… You must do this in-place without altering the nodes' values. For example,Given {1,2,3,4}, re
·
2015-10-21 12:08
order
[
leedcode
139] Word Break
Given a string s and a dictionary of words dict, determine if s can be segmented into a space-separated sequence of one or more dictionary words. For example, givens =&n
·
2015-10-21 12:07
break
[
leedcode
138] Copy List with Random Pointer
A linked list is given such that each node contains an additional random pointer which could point to any node in the list or null. Return a deep copy of the list. /** * Definition for singly-lin
·
2015-10-21 12:07
Random
[
leedcode
140] Word Break II
Given a string s and a dictionary of words dict, add spaces in s to construct a sentence where each word is a valid dictionary word. Return all such possible sentences. For
·
2015-10-21 12:07
break
[
leedcode
135] Candy
There are N children standing in a line. Each child is assigned a rating value. You are giving candies to these children subjected to the following requirements: Each child must have at
·
2015-10-21 12:05
code
[
leedcode
137] Single Number II
Given an array of integers, every element appears three times except for one. Find that single one. public class Solution { public int singleNumber(int[] nums) { //int的32个bit
·
2015-10-21 12:05
number
[
leedcode
136] Single Number
Given an array of integers, every element appears twice except for one. Find that single one. Note:Your algorithm should have a linear runtime complexity. Could you implement it without usi
·
2015-10-21 12:04
number
[
leedcode
134] Gas Station
There are N gas stations along a circular route, where the amount of gas at station i is gas[i]. You have a car with an unlimited gas tank and it costs cost[i] of g
·
2015-10-21 12:02
code
[
leedcode
116] Populating Next Right Pointers in Each Node
Given a binary tree struct TreeLinkNode { TreeLinkNode *left; TreeLinkNode *right; TreeLinkNode *next; } Populate each next pointer to point to its next right
·
2015-10-21 12:02
right
[
leedcode
117] Populating Next Right Pointers in Each Node II
Follow up for problem "Populating Next Right Pointers in Each Node". What if the given tree could be any binary tree? Would your previous solution still work? Note: You may only use co
·
2015-10-21 12:02
right
[
leedcode
115] Distinct Subsequences
Given a string S and a string T, count the number of distinct subsequences of T in S. A subsequence of a string is a new string which is formed from the original string
·
2015-10-21 12:00
sequence
[
leedcode
113] Path Sum II
Given a binary tree and a sum, find all root-to-leaf paths where each path's sum equals the given sum. For example:Given the below binary tree and sum = 22, 5 / \
·
2015-10-21 12:59
code
[
leedcode
112] Path Sum
Given a binary tree and a sum, determine if the tree has a root-to-leaf path such that adding up all the values along the path equals the given sum. For example:Given the below binary tree and s
·
2015-10-21 12:59
code
[
leedcode
114] Flatten Binary Tree to Linked List
Given a binary tree, flatten it to a linked list in-place. For example,Given 1 / \ 2 5 / \ \ 3 4 6 The flattened tree should look like:
·
2015-10-21 12:59
binary
[
leedcode
111] Minimum Depth of Binary Tree
Given a binary tree, find its minimum depth. The minimum depth is the number of nodes along the shortest path from the root node down to the nearest leaf node. /** * Definition for a binary tree
·
2015-10-21 12:58
binary
[
leedcode
109] Convert Sorted List to Binary Search Tree
Given a singly linked list where elements are sorted in ascending order, convert it to a height balanced BST. /** * Definition for singly-linked list. * public class ListNode { * int val;
·
2015-10-21 12:57
Binary search
[
leedcode
108] Convert Sorted Array to Binary Search Tree
Given an array where elements are sorted in ascending order, convert it to a height balanced BST. /** * Definition for a binary tree node. * public class TreeNode { * int val; * Tree
·
2015-10-21 12:56
Binary search
[
leedcode
110] Balanced Binary Tree
Given a binary tree, determine if it is height-balanced. For this problem, a height-balanced binary tree is defined as a binary tree in which the depth of the two subtrees of every node nev
·
2015-10-21 12:56
binary
[
leedcode
105] Construct Binary Tree from Preorder and Inorder Traversal
Given preorder and inorder traversal of a tree, construct the binary tree. Note:You may assume that duplicates do not exist in the tree. /** * Definition for a binary tree node. * public class
·
2015-10-21 12:55
binary
[
leedcode
107] Binary Tree Level Order Traversal II
Given a binary tree, return the bottom-up level order traversal of its nodes' values. (ie, from left to right, level by level from leaf to root). For example:Given binary tree {3,9,20,
·
2015-10-21 12:55
binary
上一页
3
4
5
6
7
8
9
10
下一页
按字母分类:
A
B
C
D
E
F
G
H
I
J
K
L
M
N
O
P
Q
R
S
T
U
V
W
X
Y
Z
其他