2015年5月14日
Java for LeetCode 048 Rotate Image
摘要： You are given an n x n 2D matrix representing an image.Rotate the image by 90 degrees (clockwise).Follow up:Could you do this in-place?解题思路：找规律即可，JAVA... 阅读全文
posted @ 2015-05-14 21:41 TonyLuis 阅读(131) 评论(0) 推荐(0)
Java for LeetCode 047 Permutations II
摘要： Given a collection of numbers that might contain duplicates, return all possible unique permutations. For example,[1,1,2] have the following unique pe... 阅读全文
posted @ 2015-05-14 20:08 TonyLuis 阅读(226) 评论(0) 推荐(0)
Java for LeetCode 046 Permutations
摘要： Given a collection of numbers, return all possible permutations. For example,[1,2,3] have the following permutations:[1,2,3], [1,3,2], [2,1,3], [2,3,1... 阅读全文
posted @ 2015-05-14 19:59 TonyLuis 阅读(479) 评论(0) 推荐(0)
Java for LeetCode 045 Jump Game II
摘要： Given an array of non-negative integers, you are initially positioned at the first index of the array.Each element in the array represents your maximu... 阅读全文
posted @ 2015-05-14 19:28 TonyLuis 阅读(153) 评论(0) 推荐(0)
Java for LeetCode 044 Wildcard Matching
摘要： Implement wildcard pattern matching with support for '?' and '*'.'?' Matches any single character.'*' Matches any sequence of characters (including th... 阅读全文
posted @ 2015-05-14 16:34 TonyLuis 阅读(200) 评论(0) 推荐(0)
2015年5月11日
Java for LeetCode 043 Multiply Strings
摘要： Given two numbers represented as strings, return multiplication of the numbers as a string.Note: The numbers can be arbitrarily large and are non-nega... 阅读全文
posted @ 2015-05-11 23:48 TonyLuis 阅读(310) 评论(0) 推荐(0)
Java for LeetCode 042 Trapping Rain Water
摘要： Given n non-negative integers representing an elevation map where the width of each bar is 1, compute how much water it is able to trap after raining.... 阅读全文
posted @ 2015-05-11 23:22 TonyLuis 阅读(153) 评论(0) 推荐(0)
Java for LeetCode 041 First Missing Positive
摘要： Given an unsorted integer array, find the first missing positive integer. For example,Given [1,2,0] return 3,and [3,4,-1,1] return 2.Your algorithm sh... 阅读全文
posted @ 2015-05-11 22:27 TonyLuis 阅读(151) 评论(0) 推荐(0)
Java for LeetCode 040 Combination Sum II
摘要： Given a collection of candidate numbers (C) and a target number (T), find all unique combinations in C where the candidate numbers sums to T.Each numb... 阅读全文
posted @ 2015-05-11 20:42 TonyLuis 阅读(195) 评论(0) 推荐(0)
Java for LeetCode 039 Combination Sum
摘要： Given a set of candidate numbers (C) and a target number (T), find all unique combinations in C where the candidate numbers sums to T.The same repeate... 阅读全文
posted @ 2015-05-11 20:25 TonyLuis 阅读(151) 评论(0) 推荐(0)