题记
时隔若干年后,我又开始刷leetcode了,看看这次会刷多少。
题目
Given the root of a binary search tree (BST) with duplicates, return all the mode(s) (i.e., the most frequently occurred element) in it.
If the tree has more than one …
P8602 [蓝桥杯 2013 省 A] 大臣的旅费 - 洛谷 | 计算机科学教育新生态 (luogu.com.cn) #include<iostream>
#include <algorithm>
#include <vector>
using namespace std;
#define int long long
const int N5e5100;
int n;
int res0;
typedef pair<int,…