问题描述
示例1:
输入: root = [3,1,4,null,2], k = 1
3
/ \
1 4
\
2
输出: 4
示例 2:
输入: root = [5,3,6,2,4,null,null,1], k = 3
5
/ \
3 6
/ \
2 4
/
1
输出: 4
问题解决
使用中序遍历获取数组顺序,然后去第k位
class Solution {
public int kthLargest(TreeNode root, int k) {
//中序遍历获取数组
List<Integer> list = new ArrayList<>();
getTree(root, list);
int res = list.get(k - 1);
return res;
}
public void getTree(TreeNode root, List<Integer> list) {
if(root == null) return;
getTree(root.right, list);
list.add(root.val);
getTree(root.left, list);
}
}
优化方法
class Solution {
int k, res;
public int kthLargest(TreeNode root, int k) {
//中序遍历获取数组
this.k = k;
getTree(root);
return res;
}
public void getTree(TreeNode root) {
if(root == null) return;
getTree(root.right);
k--;
if(k == 0) res = root.val;
getTree(root.left);
}
}
来源:力扣(LeetCode)
链接:https://leetcode-cn.com/problems/er-cha-sou-suo-shu-de-di-kda-jie-dian-lcof
著作权归领扣网络所有。商业转载请联系官方授权,非商业转载请注明出处。