![](https://img-blog.csdnimg.cn/20201014180756724.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
L1:strStr到subSet和Permutation
sunliuxun
Always Stay out of the Comfort Zone.
展开
-
L1:Letter Combinations of a Phone Number
https://oj.leetcode.com/problems/letter-combinations-of-a-phone-number/ Given a digit string, return all possible letter combinations that the number could represent. A mapping of digit to letters转载 2014-09-27 07:24:03 · 331 阅读 · 0 评论 -
L1:03 - subSets
https://oj.leetcode.com/problems/subsets/ Given a set of distinct integers, S, return all possible subsets. Note: Elements in a subset must be in non-descending order. The solution set must not c转载 2014-09-16 06:07:48 · 386 阅读 · 0 评论 -
L1:02 - Implement strStr()
Implement strStr(). Returns a pointer to the first occurrence of needle in haystack, or null if needle is not part of haystack.转载 2014-09-16 05:53:25 · 306 阅读 · 0 评论 -
L1:Palindrome Partitioning
https://oj.leetcode.com/problems/palindrome-partitioning/转载 2014-09-27 07:25:18 · 293 阅读 · 0 评论 -
L1:Combination Sum
https://oj.leetcode.com/problems/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 rep转载 2014-09-27 07:20:47 · 244 阅读 · 0 评论 -
L1:06 - 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 permutations: [1,1,2], [1,2,1], and [2,1,1].转载 2014-09-27 07:15:58 · 360 阅读 · 0 评论 -
L1:05 - Permutations
https://oj.leetcode.com/problems/permutations/转载 2014-09-27 07:12:56 · 337 阅读 · 0 评论 -
L1:04 - Subsets II
https://oj.leetcode.com/problems/subsets-ii/ Given a collection of integers that might contain duplicates, S, return all possible subsets. Note: Elements in a subset must be in non-descending order转载 2014-09-16 06:14:22 · 335 阅读 · 0 评论 -
L1:01 - 关于面试
1.面试前: -转载 2014-09-27 07:10:30 · 315 阅读 · 0 评论 -
L1:Restore IP Addresses
https://oj.leetcode.com/problems/restore-ip-addresses/ Given a string containing only digits, restore it by returning all possible valid IP address combinations. For example: Given "25525511135", r转载 2014-09-27 07:27:52 · 298 阅读 · 0 评论