2015年5月18日
Java for LeetCode 080 Remove Duplicates from Sorted Array II
摘要： Follow up for "Remove Duplicates":What if duplicates are allowed at most twice?For example,Given sorted array nums = [1,1,1,2,2,3],Your function shou... 阅读全文
posted @ 2015-05-18 23:31 TonyLuis 阅读(131) 评论(0) 推荐(0)
Java for LeetCode 079 Word Search
摘要： Given a 2D board and a word, find if the word exists in the grid.The word can be constructed from letters of sequentially adjacent cell, where "adjace... 阅读全文
posted @ 2015-05-18 23:13 TonyLuis 阅读(188) 评论(0) 推荐(0)
Java for LeetCode 078 Subsets
摘要： Given a set of distinct integers, nums, return all possible subsets.Note:Elements in a subset must be in non-descending order.The solution set must no... 阅读全文
posted @ 2015-05-18 22:29 TonyLuis 阅读(283) 评论(0) 推荐(0)
Java for LeetCode 077 Combinations
摘要： Given two integers n and k, return all possible combinations of k numbers out of 1 ... n. For example,If n = 4 and k = 2, a solution is:[ [2,4], [3,... 阅读全文
posted @ 2015-05-18 21:29 TonyLuis 阅读(149) 评论(0) 推荐(0)
Java for LeetCode 076 Minimum Window Substring
摘要： Given a string S and a string T, find the minimum window in S which will contain all the characters in T in complexity O(n). For example,S = "ADOBECOD... 阅读全文
posted @ 2015-05-18 20:56 TonyLuis 阅读(198) 评论(0) 推荐(0)