LeetCode113—路径总和 II

递归:

// 递归
	public List<List<Integer>> pathSum(TreeNode root, int sum) {
		List<List<Integer>> res = new ArrayList<>();
		List<Integer> out = new ArrayList<>();
		dfsPathSum(root, sum, out, res);
		return res;
	}

	public void dfsPathSum(TreeNode node, int sum, List<Integer> out, List<List<Integer>> res) {
		if (node == null)
			return;
		out.add(node.val);
		if (sum == node.val && node.left == null && node.right == null) {
			List<Integer> newList = new ArrayList<Integer>(out);
			res.add(newList);
		}
		dfsPathSum(node.left, sum - node.val, out, res);
		dfsPathSum(node.right, sum - node.val, out, res);
		out.remove(out.size() - 1);
	}

迭代:

	public List<List<Integer>> pathSum1(TreeNode root, int sum) {
		List<List<Integer>> res = new ArrayList<>();
		List<TreeNode> s = new ArrayList<>();
		TreeNode cur = root, pre = null;
		int val = 0;
		while (cur != null || !s.isEmpty()) {
			while (cur != null) {
				s.add(cur);
				val += cur.val;
				cur = cur.left;

			}
			cur = s.get(s.size() - 1);
			if (cur.left == null && cur.right == null && val == sum) {
				List<Integer> v = new ArrayList<>();
				for (TreeNode it : s) {
					v.add(it.val);
				}
				res.add(v);
			}
			if (cur.right != null && cur.right != pre)
				cur = cur.right;
			else {
				pre = cur;
				val -= cur.val;
				s.remove(s.size() - 1);
				cur = null;
			}

		}
		return res;

	}

 

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值