摘要：
Find all possible combinations of k numbers that add up to a number n, given that only numbers from 1 to 9 can be used and each combination should be 阅读全文
posted @ 2019-01-02 13:23
yuxihong
阅读(95)
评论(0)
推荐(0)
摘要：
Implement a magic directory with buildDict, and search methods. For the method buildDict, you'll be given a list of non-repetitive words to build a di 阅读全文
posted @ 2019-01-02 13:10
yuxihong
阅读(1107)
评论(0)
推荐(0)
摘要：
Given two strings s1, s2, find the lowest ASCII sum of deleted characters to make two strings equal. Example 1: Example 2: Note: 0 < s1.length, s2.len 阅读全文
posted @ 2019-01-02 12:52
yuxihong
阅读(165)
评论(0)
推荐(0)
浙公网安备 33010602011771号