| | | | |

2016年10月16日

leetcode 80 Remove Duplicates from Sorted Array II ----- java

摘要： 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 sho 阅读全文

posted @ 2016-10-16 18:02 xiaoba1203 阅读(228) 评论(0) 推荐(0)

leetcode 79 Word Search ----- java

摘要： 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 "adjac 阅读全文

posted @ 2016-10-16 17:40 xiaoba1203 阅读(690) 评论(0) 推荐(0)

leetcode 78 Subsets ----- java

摘要： Given a set of distinct integers, nums, return all possible subsets. Note: The solution set must not contain duplicate subsets. For example,If nums = 阅读全文

posted @ 2016-10-16 16:32 xiaoba1203 阅读(227) 评论(0) 推荐(0)

leetcode 77 Combinations ----- java

摘要： 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: 求C(k,n)的所有结果。阅读全文

posted @ 2016-10-16 16:20 xiaoba1203 阅读(287) 评论(0) 推荐(0)

leetcode 76 Minimum Window Substring ----- java

摘要： 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 @ 2016-10-16 13:57 xiaoba1203 阅读(240) 评论(0) 推荐(0)

2016年10月16日

公告