leetcode112 path sum
来源:互联网 发布:淘宝联华文具 编辑:程序博客网 时间:2024/06/06 18:54
题目
Given a binary tree and a sum, determine if the tree has a root-to-leaf path such that adding up all the values along the path equals the given sum.
For example:
Given the below binary tree and sum = 22,
5 / \ 4 8 / / \ 11 13 4 / \ \ 7 2 1
return true, as there exist a root-to-leaf path 5->4->11->2 which sum is 22.
使用深度优先遍历,递归的结束条件需要好好考虑一下
下面是代码:
/** * Definition for a binary tree node. * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) : val(x), left(NULL), right(NULL) {} * }; */class Solution {public: bool hasPathSum(TreeNode* root, int sum) { bool re = false; hasPathSum(root, sum, re); return re; } // 因为需要考虑当首节点是空节点的时候的情况,所以使用一个辅助函数 void hasPathSum(TreeNode* root, int sum, bool &re){ if(!root) return; if(!root->left && !root->right && sum == root->val) { re = true; return; } bool re1 = false; bool re2 = false; hasPathSum(root->left, sum - root->val, re1); hasPathSum(root->right, sum - root->val, re2); re = re1 || re2; return; }};
阅读全文
0 0
- leetcode112 Path Sum
- leetcode112---Path Sum
- LeetCode112—Path Sum
- leetcode112. Path Sum
- Leetcode112. Path Sum
- LeetCode112. Path Sum
- LeetCode112. Path Sum
- leetcode112~Path Sum
- LeetCode112.Path Sum题解
- LeetCode112 Path Sum
- leetcode112. Path Sum
- leetcode112 path sum
- LeetCode112. Path Sum
- LeetCode112——Path Sum
- LeetCode112. Path Sum java solution
- LeetCode112. Path Sum(Easy)
- Path Sum && Path Sum ||
- Path Sum
- 青年歌手大奖赛_评委会打分 HDU
- CTex用WinEdt打开tex中文乱码解决
- LeetCode-5-Longest Palindromic Substring 最长回文子串DP
- 数据库事务
- javascript常用函数
- leetcode112 path sum
- SELinux 初探
- 组合模式
- LeetCode
- Java基础类库简介及lang包介绍
- 【算法】欧几里德、毕达哥拉斯、帕斯卡和蒙特去公园已知三点组成平行四边形,求第四点
- CIDR地址块及其子网划分(内含原始IP地址分类及其子网划分的介绍)
- java算法之快速排序
- Vue2 全局-Vue.extend构造器拓展