摘要:
class Solution: def permute(self, nums: List[int]) -> List[List[int]]: res = [] def helper(nums, temp): if not nums: if temp not in res: res.append(te 阅读全文
摘要:
暴力 class Solution { public: vector<int> twoSum(vector<int>& nums, int target) { int i, j; for (i = 0; i < nums.size(); ++i){ for(j = i + 1; j < nums.s 阅读全文
摘要:
solution recursive class Solution: def isSymmetric(self, root: TreeNode) -> bool: def helper(q, p): if not q and not p: return True if not q and p: re 阅读全文