junxinwoxin的博客

输入：System.out.println(3 ^ 3>>1);输出：2原因待考

22. Generate ParenthesesGiven n pairs of parentheses, write a function to generate all combinations of well-formed parentheses.For example, given n = 3, a solution set is:[ "((()))", "(()())", "(

刚刚在leetcode上写了一道算法题：39. Combination Sum，因为踩了python中复制的坑，花了很长时间才爬出来=。=题目：Given a set of candidate numbers (C) (without duplicates) and a target number (T), find all unique combinations in C where the ca