leetcode513
Posted AsenYang
tags:
篇首语:本文由小常识网(cha138.com)小编为大家整理,主要介绍了leetcode513相关的知识,希望对你有一定的参考价值。
/** * Definition for a binary tree node. * public class TreeNode { * public int val; * public TreeNode left; * public TreeNode right; * public TreeNode(int x) { val = x; } * } */ public class Solution { Stack<TreeNode> S = new Stack<TreeNode>(); List<List<TreeNode>> list = new List<List<TreeNode>>(); List<TreeNode> left = new List<TreeNode>(); private void postNode(TreeNode node) { if (node != null) { S.Push(node); if (node.left != null) { if (node.left.left == null && node.left.right == null) { left.Add(node.left); } postNode(node.left); } if (node.right != null) { postNode(node.right); } if (node.left == null && node.right == null) { list.Add(S.ToList()); } S.Pop(); } } public int FindBottomLeftValue(TreeNode root) { postNode(root); list = list.OrderByDescending(x => x.Count).ToList(); var result = root.val; foreach (var l in list) { result = l[0].val; break; } return result; } }
https://leetcode.com/problems/find-bottom-left-tree-value/#/description
以上是关于leetcode513的主要内容,如果未能解决你的问题,请参考以下文章
Python描述 LeetCode 513. 找树左下角的值
leetcode513 FindBottomLeftTreeValue Java
[LeetCode] 513. Find Bottom Left Tree Value