//基于map的改进,时间复杂度O(n)快一些 class Solution { public: map<int, int> m; int duplicate(vector<int>& numbers) { // write code here if (numbers.empty()) return -1; int size = numbers.size(); int k1 = size - 1 / 2; int k2 = size - 1 ...