leetcode
stupidstan
这个作者很懒,什么都没留下…
展开
-
Binary Tree Postorder Traversal
/** * Definition for binary tree * public class TreeNode { * int val; * TreeNode left; * TreeNode right; * TreeNode(int x) { val = x; } * } */public class Solution { publi原创 2013-12-01 09:57:06 · 414 阅读 · 0 评论 -
Pascal's Triangle II
public class Solution { public ArrayList getRow(int rowIndex) { // Start typing your Java solution below // DO NOT write main() function ArrayList ret = new ArrayList();原创 2013-04-19 21:10:05 · 428 阅读 · 0 评论 -
Pascal's Triangle
public class Solution { public ArrayList> generate(int numRows) { // Start typing your Java solution below // DO NOT write main() function ArrayList> ret = new Ar原创 2013-04-19 20:59:43 · 360 阅读 · 0 评论 -
Maximum Depth of Binary Tree
/** * Definition for binary tree * public class TreeNode { * int val; * TreeNode left; * TreeNode right; * TreeNode(int x) { val = x; } * } */public class Solution { publi原创 2013-04-19 17:22:38 · 342 阅读 · 0 评论 -
Same Tree
public class Solution { public boolean isSameTree(TreeNode p, TreeNode q) { // Start typing your Java solution below // DO NOT write main() function if(p==null&&q==null)ret原创 2013-04-19 16:54:27 · 371 阅读 · 0 评论 -
Remove Duplicates from Sorted List II
/** * Definition for singly-linked list. * public class ListNode { * int val; * ListNode next; * ListNode(int x) { * val = x; * next = null; * } * } */public原创 2013-04-19 16:33:24 · 561 阅读 · 0 评论 -
Binary Tree Maximum Path Sum
/** * Definition for binary tree * public class TreeNode { * int val; * TreeNode left; * TreeNode right; * TreeNode(int x) { val = x; } * } */public class Solution {原创 2013-04-20 17:08:11 · 418 阅读 · 0 评论 -
Populating Next Right Pointers in Each Node II
/** * Definition for binary tree with next pointer. * public class TreeLinkNode { * int val; * TreeLinkNode left, right, next; * TreeLinkNode(int x) { val = x; } * } */public class原创 2013-04-20 15:29:15 · 465 阅读 · 0 评论 -
Jump Game
public class Solution { public boolean canJump(int[] A) { // Start typing your Java solution below // DO NOT write main() function if(A==null||A.length==1)return true;原创 2013-04-20 10:00:08 · 475 阅读 · 0 评论 -
Symmetric Tree
开始想到用栈存左子树的中跟序和右子树的相反访问,然后比较,中间还要克胡空白的问题,太绕了。看了下还是这种方法直观,最直接。/** * Definition for binary tree * public class TreeNode { * int val; * TreeNode left; * TreeNode right; * TreeNode原创 2013-04-19 17:17:34 · 410 阅读 · 0 评论 -
Merge Sorted Array
public class Solution { public void merge(int A[], int m, int B[], int n) { // Start typing your Java solution below // DO NOT write main() function if(n==0)return;原创 2013-04-19 16:46:34 · 349 阅读 · 0 评论 -
Populating Next Right Pointers in Each Node
/** * Definition for binary tree with next pointer. * public class TreeLinkNode { * int val; * TreeLinkNode left, right, next; * TreeLinkNode(int x) { val = x; } * } */public class原创 2013-04-20 15:23:25 · 470 阅读 · 0 评论 -
Triangle
public class Solution { public int minimumTotal(ArrayList> triangle) { // Start typing your Java solution below // DO NOT write main() function if(triangle==null)return 0;原创 2013-04-20 14:49:01 · 483 阅读 · 0 评论 -
Best Time to Buy and Sell Stock III
public int maxProfit(int[] prices) { if(prices==null || prices.length==0) return 0; int len=prices.length; int[] dp1=new int[len]; int[] d转载 2013-04-20 00:41:19 · 1377 阅读 · 0 评论 -
Convert Sorted Array to Binary Search Tree
/** * Definition for binary tree * public class TreeNode { * int val; * TreeNode left; * TreeNode right; * TreeNode(int x) { val = x; } * } */public class Solution { publi原创 2013-04-19 17:48:01 · 392 阅读 · 0 评论 -
Remove Duplicates from Sorted List
/** * Definition for singly-linked list. * public class ListNode { * int val; * ListNode next; * ListNode(int x) { * val = x; * next = null; * } * } */public原创 2013-04-19 15:44:51 · 365 阅读 · 0 评论 -
Valid Palindrome
public class Solution { public boolean isPalindrome(String s) { // Start typing your Java solution below // DO NOT write main() function if(s==null)return true; if(原创 2013-04-20 10:52:44 · 353 阅读 · 0 评论 -
ZigZag Conversion
public class Solution { public String convert(String s, int nRows) { // Start typing your Java solution below // DO NOT write main() function StringBuilder[] sb = new Strin原创 2013-04-20 09:37:53 · 622 阅读 · 0 评论 -
Best Time to Buy and Sell Stock
public class Solution { public int maxProfit(int[] prices) { // Start typing your Java solution below // DO NOT write main() function int len = prices.length; if(le原创 2013-04-19 21:22:32 · 567 阅读 · 0 评论 -
Best Time to Buy and Sell Stock II
public class Solution { public int maxProfit(int[] prices) { // Start typing your Java solution below // DO NOT write main() function int len = prices.length; if(le原创 2013-04-19 21:32:55 · 767 阅读 · 0 评论 -
Binary Tree Preorder Traversal
/** * Definition for binary tree * public class TreeNode { * int val; * TreeNode left; * TreeNode right; * TreeNode(int x) { val = x; } * } */public class Solution { publi原创 2013-12-01 09:34:00 · 397 阅读 · 0 评论 -
Word Break
public class Solution { public static Set unmatch; public boolean wordBreak(String s, Set dict) { unmatch = new HashSet(); return helper(s,dict); } public boolean helper(转载 2013-12-01 10:46:07 · 437 阅读 · 0 评论 -
Sort List (大的还没跑通)
public class Solution { public ListNode sortList(ListNode head) { // IMPORTANT: Please reset any member data you declared, as // the same Solution instance will be reused for each原创 2013-11-24 17:51:37 · 475 阅读 · 0 评论 -
leetcode难度表
zz from : https://docs.google.com/spreadsheet/pub?key=0Aqt--%20wSNYfuxdGxQWVFsOGdVVWxQRlNUVXZTdEpOeEE&output=htmlLeetCode Question Difficulty Distribution : Sheet1转载 2013-11-22 19:53:16 · 993 阅读 · 0 评论 -
Search in Rotated Sorted Array
public class Solution { public int search(int[] A, int target) { // Start typing your Java solution below // DO NOT write main() function int len = A.length; int lo原创 2013-04-30 19:13:00 · 414 阅读 · 0 评论 -
Binary Tree Level Order Traversal II
/** * Definition for binary tree * public class TreeNode { * int val; * TreeNode left; * TreeNode right; * TreeNode(int x) { val = x; } * } */public class Solution { publi原创 2013-04-22 09:16:59 · 351 阅读 · 0 评论 -
Combination Sum
public class Solution { public ArrayList l; public ArrayList> l1; public ArrayList> combinationSum(int[] candidates, int target) { // Start typing your Java solution below原创 2013-04-21 21:59:11 · 541 阅读 · 0 评论 -
Distinct Subsequences
public class Solution { public int numDistinct(String S, String T) { // Start typing your Java solution below // DO NOT write main() function if(S==null||T==null)return 0;原创 2013-04-21 17:55:11 · 385 阅读 · 0 评论 -
Sudoku Solver
public class Solution { private char[][] board; public void solveSudoku(char[][] board) { // Start typing your Java solution below // DO NOT write main() function this.原创 2013-04-20 18:14:33 · 329 阅读 · 0 评论 -
Search for a Range
public class Solution { public int[] searchRange(int[] A, int target) { // Start typing your Java solution below // DO NOT write main() function boolean isfound = false;原创 2013-04-30 18:42:17 · 344 阅读 · 0 评论 -
Balanced Binary Tree
/** * Definition for binary tree * public class TreeNode { * int val; * TreeNode left; * TreeNode right; * TreeNode(int x) { val = x; } * } */public class Solution { publi原创 2013-04-21 20:03:31 · 436 阅读 · 0 评论 -
Minimum Depth of Binary Tree
public class Solution { public int minDepth(TreeNode root) { // Start typing your Java solution below // DO NOT write main() function if(root==null)return 0; return原创 2013-04-21 19:27:18 · 360 阅读 · 0 评论 -
Flatten Binary Tree to Linked List
/** * Definition for binary tree * public class TreeNode { * int val; * TreeNode left; * TreeNode right; * TreeNode(int x) { val = x; } * } */public class Solution { priva原创 2013-04-21 19:06:49 · 365 阅读 · 0 评论 -
Sum Root to Leaf Numbers
/** * Definition for binary tree * public class TreeNode { * int val; * TreeNode left; * TreeNode right; * TreeNode(int x) { val = x; } * } */public class Solution { publi原创 2013-04-20 14:31:36 · 351 阅读 · 0 评论 -
path sumII
public class Solution { public ArrayList list1 = new ArrayList(); public ArrayList> list = new ArrayList>(); public ArrayList> pathSum(TreeNode root, int sum) { if(root==n原创 2013-04-19 20:38:37 · 455 阅读 · 0 评论 -
Path Sum
/** * Definition for binary tree * public class TreeNode { * int val; * TreeNode left; * TreeNode right; * TreeNode(int x) { val = x; } * } */public class Solution { publi原创 2013-04-19 18:52:28 · 377 阅读 · 0 评论 -
Remove Duplicates from Sorted Array II
public class Solution { public int removeDuplicates(int[] A) { // Start typing your Java solution below // DO NOT write main() function int len = A.length; if(len==原创 2013-04-19 15:38:27 · 324 阅读 · 0 评论 -
Palindrome Number
public class Solution { public boolean isPalindrome(int x) { // Start typing your Java solution below // DO NOT write main() function //if(x==1120110211)return true; int原创 2013-04-18 10:15:20 · 327 阅读 · 0 评论 -
atoi
思路1.去空格2.判断正负,int sign3.读取每个数,4.判断溢出。retpublic class Solution { public int atoi(String str) { if(str.equals(""))return 0; int len = str.length(); int i = 0;原创 2013-04-17 23:08:47 · 355 阅读 · 0 评论 -
reverse integer
public class Solution { public int reverse(int x) { // Start typing your Java solution below // DO NOT write main() function if(x==0)return 0; int[] num = new int[100原创 2013-04-17 21:07:48 · 296 阅读 · 0 评论