Exemplos de sumOfLeftLeaves em C++ (Cpp)

Exemplo n.º 1

Arquivo: sum-of-left-leaves.cpp Projeto: liming-vie/LeetCode

 int sumOfLeftLeaves(TreeNode* root) {
     if (!root)  return 0;
     int res=0;
     if (root->left && !root->left->left && !root->left->right)
         res += root->left->val;
     else res += sumOfLeftLeaves(root->left);
     return res + sumOfLeftLeaves(root->right);
 }

Exemplo n.º 2

Arquivo: Sum_of_Left_Leaves.cpp Projeto: Kaidul/LeetCode_problems_solution

 int sumOfLeftLeaves(TreeNode* root) {
     if(!root) return 0;
     if(root->left and (!root->left->left and !root->left->right)) {
         return root->left->val
             + sumOfLeftLeaves(root->right);
     }
     return sumOfLeftLeaves(root->left)
         + sumOfLeftLeaves(root->right);
 }

Exemplo n.º 3

Arquivo: solution.cpp Projeto: llwwns/leetcode_solutions

 int sumOfLeftLeaves(TreeNode* root, bool is_left = false) {
     if (root == NULL) {
         return 0;
     }
     if (root->left == NULL && root->right == NULL && is_left) {
         return root->val;
     }
     return sumOfLeftLeaves(root->left, true) + sumOfLeftLeaves(root->right, false);
 }

Exemplo n.º 4

Arquivo: sum-of-left-leaves_1_AC.cpp Projeto: Septemberchar/leetcode-2

 int sumOfLeftLeaves(TreeNode* root) {
     if (root == NULL || isLeave(root)) {
         return 0;
     }
     int sum = sumOfLeftLeaves(root->left) + sumOfLeftLeaves(root->right);
     if (isLeave(root->left)) {
         sum += root->left->val;
     }
     return sum;
 }

Exemplo n.º 5

Arquivo: sumOfLeftLeaves.cpp Projeto: zeng-zc/leetcode

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     struct TreeNode *left;
 *     struct TreeNode *right;
 * };
 */
int sumOfLeftLeaves(struct TreeNode* root) {
    if (!root || (!root->left && !root->right))
        return 0;
    int rightsum = sumOfLeftLeaves(root->right);
    struct TreeNode* left = root->left;
    if (left && !left->left && !left->right)
        return root->left->val + rightsum;
    else
        return sumOfLeftLeaves(root->left) + rightsum;
    
}

Exemplo n.º 6

Arquivo: main.cpp Projeto: Leobuaa/LeetCode

 int sumOfLeftLeaves(TreeNode* root) {
     if (!root) {
         return 0;
     }
     
     if (root->left && !root->left->left && !root->left->right) {
         return root->left->val + sumOfLeftLeaves(root->right);
     }
     
     return sumOfLeftLeaves(root->left) + sumOfLeftLeaves(root->right);
 }

Exemplo n.º 7

Arquivo: 404.cpp Projeto: booirror/LeetCode-cpp

 int sumOfLeftLeaves(TreeNode* root) {  
     if (root == nullptr) return 0;  
     if (root->left) {  
         if (root->left->left == nullptr && root->left->right == nullptr) {  
             return root->left->val + sumOfLeftLeaves(root->right);  
         } else {  
             return sumOfLeftLeaves(root->left) + sumOfLeftLeaves(root->right);  
         }  
     } else {  
         return sumOfLeftLeaves(root->right);  
     }  
 }  

Exemplo n.º 8

Arquivo: 404. Sum of Left Leaves.cpp Projeto: Lawrenceh/AC_Monster

 int sumOfLeftLeaves(TreeNode* root) {
     if (!root) return 0;
     int ans = 0;
     if (root->left) { // check if we could finish search on left child and add it to sum
         if (root->left->left == nullptr && root->left->right == nullptr) {
             ans += root->left->val;
         } else {
             ans += sumOfLeftLeaves(root->left);
         }
     }
     ans += sumOfLeftLeaves(root->right);
     return ans;
 }

Exemplo n.º 9

Arquivo: Solution.76820258.cpp Projeto: rahul-ramadas/leetcode

 int sumOfLeftLeaves(TreeNode* root, bool isLeft = false) {
     if (!root)
     {
         return 0;
     }
     
     if ((root->left == nullptr) && (root->right == nullptr))
     {
         return isLeft ? root->val : 0;
     }
     
     return sumOfLeftLeaves(root->left, true) + sumOfLeftLeaves(root->right, false);
 }

Exemplo n.º 10

Arquivo: 404. Sum of Left Leaves.cpp Projeto: varunvd1994/Programs

 int sumOfLeftLeaves(TreeNode* root) {
     if(root==NULL)
         return 0;
     int left = 0; //to calculate left sum
     if(root->left &&root->left->left == NULL && root->left->right == NULL) //check for leaf left node
     {
         left = root->left->val;
     }
     else
     {
         left = sumOfLeftLeaves(root->left); //recur in left subtree
     }
     //compulsory
     int right = sumOfLeftLeaves(root->right); //recur in right subtree for left leaf nodes
     return left+right;
 }

Exemplo n.º 11

Arquivo: 404. Sum of Left Leaves.cpp Projeto: sungzh/leetcode

 int sumOfLeftLeaves(TreeNode* root) {
     if(root==NULL) return 0;
     if(root->left && root->left->left==NULL && root->left->right==NULL) return root->left->val + sumOfLeftLeaves(root->right);
     return sumOfLeftLeaves(root->left) + sumOfLeftLeaves(root->right);
 }