![](https://img-blog.csdnimg.cn/20201014180756780.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
search
文章平均质量分 77
yoohoosome
这个作者很懒,什么都没留下…
展开
-
[刷题]Palindrome Partitioning
[刷题]Palindrome Partitioningpublic class Solution { /** * @param s: A string * @return: A list of lists of string */ public List> partition(String s) { // 2015-07-08原创 2015-07-08 20:20:28 · 279 阅读 · 0 评论 -
[刷题]k Sum II
[LintCode]k Sum IIpublic class Solution { /** * @param A: an integer array. * @param k: a positive integer (k <= length(A)) * @param target: a integer * @return a list of lis原创 2015-08-31 09:34:12 · 296 阅读 · 0 评论 -
[刷题]Word Ladder
[LintCode]Word Ladderpublic class Solution { /** * @param start, a string * @param end, a string * @param dict, a set of string * @return an integer */ public i原创 2015-07-11 12:03:47 · 365 阅读 · 0 评论 -
[刷题]Combination Sum II
[LintCode]Combination Sum IIpublic class Solution { /** * @param num: Given the candidate numbers * @param target: Given the target number * @return: All the combinations that sum原创 2015-07-09 19:13:42 · 265 阅读 · 0 评论 -
[刷题]Subsets
[LintCode]Subsetsclass Solution { /** * @param S: A set of numbers. * @return: A list of lists. All valid subsets. */ public ArrayList> subsets(ArrayList S) { // 2015-原创 2015-07-07 20:59:00 · 299 阅读 · 1 评论 -
[刷题]Subsets II
[LintCode]Subsets IIclass Solution { /** * @param S: A set of numbers. * @return: A list of lists. All valid subsets. */ public ArrayList> subsetsWithDup(ArrayList S) {原创 2015-07-08 09:49:31 · 387 阅读 · 1 评论 -
[刷题]N-Queens II
[LintCode]N-Queens IIclass Solution { /** * Calculate the total number of distinct N-Queen solutions. * @param n: The number of queens. * @return: The total number of distinct sol原创 2015-08-29 19:53:06 · 314 阅读 · 0 评论 -
[刷题]Permutations II
[LintCode]Permutations IIclass Solution { /** * @param nums: A list of integers. * @return: A list of unique permutations. */ public ArrayList> permuteUnique(ArrayList nums) {原创 2015-08-29 12:48:10 · 293 阅读 · 0 评论 -
[刷题]N-Queens
[LintCode]N-Queensclass Solution { /** * Get all distinct N-Queen solutions * @param n: The number of queens * @return: All distinct solutions * For example, A string '...Q'原创 2015-07-07 21:39:11 · 307 阅读 · 0 评论 -
[刷题]Combination Sum
[LintCode]Combination Sumpublic class Solution { /** * @param candidates: A list of integers * @param target:An integer * @return: A list of lists of integers */ public L原创 2015-07-09 10:05:55 · 289 阅读 · 0 评论 -
[刷题]Permutations
class Solution { /** * @param nums: A list of integers. * @return: A list of permutations. */ public ArrayList permute(ArrayList nums) { // 2015-3-18 ArrayList rst = new ArrayList<>(); if (nums == nul原创 2015-03-20 18:05:40 · 281 阅读 · 1 评论 -
[刷题]Word Ladder II
[LintCode]Word Ladder IIpublic class Solution { /** * @param start, a string * @param end, a string * @param dict, a set of string * @return a list of lists of string原创 2015-08-30 13:34:01 · 304 阅读 · 0 评论