摘要:
class Solution { public: int getNumberSameAsIndex(vector<int>& nums) { int n = nums.size(); int l = 0, r = nums.size() - 1; while (l < r) { int mid = 阅读全文
posted @ 2021-08-02 14:51
Dazzling!
阅读(36)
评论(0)
推荐(0)
摘要:
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 阅读全文
posted @ 2021-08-02 14:47
Dazzling!
阅读(32)
评论(0)
推荐(0)

浙公网安备 33010602011771号