LeetCode
文章平均质量分 50
xinglu31
好记性不如烂笔头
展开
-
Minimum 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...原创 2014-05-20 11:39:58 · 536 阅读 · 0 评论 -
Two Sum
public class Solution { public int[] twoSum(int[] values, int target) { Map<Integer , Integer[]> map = new HashMap<Integer , Integer[]>(); for(int i = 0 ; i < valu...原创 2014-04-22 19:56:04 · 407 阅读 · 0 评论 -
Length of Last Word
public class Solution { public int lengthOfLastWord(String s) { int res = 0; if(s.length() == 0){ return res; } char[] sArray = s.toCharArray(); ...原创 2014-05-06 09:02:53 · 443 阅读 · 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...原创 2014-05-06 18:57:09 · 712 阅读 · 0 评论 -
Remove Duplicates from Sorted Array
Remove Duplicates from Sorted Arraypublic class Solution { public int removeDuplicates(int[] A) { boolean isEqual = false; int count = 0; int tmp = 0; if(A == null...原创 2014-05-12 09:03:53 · 491 阅读 · 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...原创 2014-05-12 15:16:20 · 668 阅读 · 0 评论 -
Remove Duplicates from Sorted Array II
public class Solution { public int removeDuplicates(int[] A) { int count = 0; int tmp = 0; if(A == null || A.length == 0){ return 0; } if(A.leng...原创 2014-05-12 16:56:30 · 473 阅读 · 0 评论 -
Single Number II
public class Solution { public int singleNumber(int[] A) { Arrays.sort(A);// for(int i = 0 ; i < A.length ; i++){// System.out.println(A[i]);// } int...原创 2014-05-14 13:59:39 · 524 阅读 · 0 评论 -
Plus One
public class Solution { public int[] plusOne(int[] A) { if(A.length >= 1) { int[] B = new int[A.length + 1]; int added = 1; for(int i = A.length - 1 ; i >= 0 ; i--){ i...原创 2014-05-14 19:31:29 · 499 阅读 · 0 评论 -
Longest Consecutive Sequence
public class Solution { public int longestConsecutive(int[] num) { Arrays.sort(num); int count = 1; int res = 1; int tmp = 0 ; int countTmp = 0; for(int i = 1 ; i < num.len...原创 2014-05-15 20:10:46 · 494 阅读 · 0 评论 -
Binary Tree Level Order Traversal
/** * Definition for binary tree * public class TreeNode { * int val; * TreeNode left; * TreeNode right; * TreeNode(int x) { val = x; } * } */public class Solution { publi...原创 2014-05-15 20:20:07 · 515 阅读 · 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...原创 2014-05-20 09:42:06 · 549 阅读 · 0 评论 -
Longest Common Prefix
public class Solution { public String longestCommonPrefix(String[] strs) { int len = strs.length; if(len == 0){ return ""; } if(len == 1){ return strs[0]; } int length =...原创 2014-05-20 10:20:19 · 484 阅读 · 0 评论 -
Merge Sorted Array
public class Solution { public void merge(int A[], int m, int B[], int n) { if (n == 0) { return; } if (m == 0) { for (int tmp = 0; tmp < n; tmp++) { A[tmp] = B[tmp]; }...原创 2018-04-28 15:36:29 · 122 阅读 · 0 评论