摘要：
Note: 1. If it does not belong any sequences : append.getOrDefault(num, 0) == 0, create a new sequence. It requires num + 1 and num + 2 count > 0. 2. 阅读全文
摘要：
Note: k different could be [1, k+1] are in wiggle sort order. Then there are k different numbers. But in this case, the last difference definitely wil 阅读全文
摘要：
Note: Basic idea could be same as Kth smallest number in sorted matrix. But this could be different since all the numbers fall in [1, m*n + 1] range. 阅读全文
摘要：
class Solution { private final String[] map = {"", "", "abc", "def", "ghi", "jkl", "mno", "pqrs", "tuv", "wxyz"}; public List letterCombinations(String digits) { List result = new Arr... 阅读全文