摘要:
public static void traversal(TreeNode root){ LinkedList<TreeNode> stack = new LinkedList<>(); TreeNode p = root; int sum = 0; while (p != null || !sta 阅读全文
摘要:
L494 //方法一:回溯法 class Solution { public static int findTargetSumWays(int[] nums, int target) { cnt =0; recurve(nums, 0, 0, target); return cnt; } stati 阅读全文