从零开始的LC刷题(28): Path Sum

原题：

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.

Note: A leaf is a node with no children.

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.

题意就是从根节点到叶节点找出一条和等于sum的路，有的话返回true，先用递归试试水，结果：

Success

Runtime: 8 ms, faster than 99.42% of C++ online submissions for Path Sum.

Memory Usage: 19.9 MB, less than 57.58% of C++ online submissions for Path Sum.

代码：

/**
 * 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) {
        if(root==NULL){return false;}
        if(root->left==NULL&&root->right==NULL&&sum==root->val){return true;}
        if(hasPathSum(root->left,sum-root->val)||hasPathSum(root->right,sum-root->val)){
            return true;
        }
        return false;
    }
};

速度还行内存一般，试试循环调用发现区别不大：

Success

Runtime: 8 ms, faster than 99.42% of C++ online submissions for Path Sum.

Memory Usage: 19.8 MB, less than 74.14% of C++ online submissions for Path Sum.

代码：

/**
 * 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) {
        if(root==NULL){return false;}
        vector<TreeNode*> heap;
        vector<int> sums;
        heap.push_back(root);
        int tsum=0;
        TreeNode* p=root;
        while(!heap.empty()){
            tsum+=p->val;
            if(p->left==NULL&&p->right==NULL&&tsum==sum){return true;}
            if(p->right!=NULL){
                heap.push_back(p->right);
                sums.push_back(tsum);
            }
            if(p->left!=NULL){
                p=p->left;
                continue;
            }
            else{
                p=heap.back();
                heap.pop_back();
                if(heap.empty()){break;}
                tsum=sums.back();
                sums.pop_back();
            } 
        }
        return false;
    }
};

之后又试了试讨论区的所谓100%算法基本上都是靠运气的那种，拿来就是20ms，想了想不找好算法了。