LeetCode: Sum of Left Leaves
Posted ying_vincent
tags:
篇首语:本文由小常识网(cha138.com)小编为大家整理,主要介绍了LeetCode: Sum of Left Leaves相关的知识,希望对你有一定的参考价值。
1 /** 2 * Definition for a binary tree node. 3 * public class TreeNode { 4 * int val; 5 * TreeNode left; 6 * TreeNode right; 7 * TreeNode(int x) { val = x; } 8 * } 9 */ 10 public class Solution { 11 public int sumOfLeftLeaves(TreeNode root) { 12 if (root == null) return 0; 13 else return sumHelp(root.left, true) + sumHelp(root.right, false); 14 } 15 private int sumHelp(TreeNode root, boolean isLeft) { 16 if (root == null) return 0; 17 if (root.left == null && root.right == null && isLeft == true) return root.val; 18 return sumHelp(root.left, true) + sumHelp(root.right, false); 19 } 20 }
以上是关于LeetCode: Sum of Left Leaves的主要内容,如果未能解决你的问题,请参考以下文章
LeetCode 404. Sum of Left Leaves
leetcode?python Sum of Left Leaves