摘要：
class Solution { public: int getNumberSameAsIndex(vector<int>& nums) { int n = nums.size(); int l = 0, r = nums.size() - 1; while (l < r) { int mid = 阅读全文
摘要：
class Solution { public: int missingNumber(vector<int>& nums) { int n = nums.size() + 1; int l = 0, r = n - 1; while (l < r) { int mid = l + r >> 1; i 阅读全文