这是一个创建于 852 天前的主题，其中的信息可能已经有所发展或是发生改变。
第 124 题
本来用
PriorityQueue<Integer> q = new PriorityQueue<>(1, (o1, o2) -> o2 - o1)
保存最大值
就只超过了 5%的提交 6 ms 48.6 MB
后来直接用 1 个元素的数组保存
Runtime: 1 ms, faster than 99.67% of Java online submissions for Binary Tree Maximum Path Sum.
Memory Usage: 48 MB, less than 38.84% of Java online submissions for Binary Tree Maximum Path Sum.
本来用
PriorityQueue<Integer> q = new PriorityQueue<>(1, (o1, o2) -> o2 - o1)
保存最大值
就只超过了 5%的提交 6 ms 48.6 MB
后来直接用 1 个元素的数组保存
Runtime: 1 ms, faster than 99.67% of Java online submissions for Binary Tree Maximum Path Sum.
Memory Usage: 48 MB, less than 38.84% of Java online submissions for Binary Tree Maximum Path Sum.
Select Language