Fork me on GitHub
摘要: Given a string s, partition s such that every substring of the partition is a palindrome. Return all possible palindrome partitioning of s. For exampl 阅读全文
posted @ 2017-06-14 17:12 hellowOOOrld 阅读(265) 评论(0) 推荐(0) 编辑
摘要: 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 num 阅读全文
posted @ 2017-06-14 15:12 hellowOOOrld 阅读(186) 评论(0) 推荐(0) 编辑
摘要: There are a number of spherical balloons spread in two-dimensional space. For each balloon, provided input is the start and end coordinates of the hor 阅读全文
posted @ 2017-06-14 11:09 hellowOOOrld 阅读(173) 评论(0) 推荐(0) 编辑