摘要： 1 class Solution { public: bool search(vector<int>& nums, int target) { int index = -1; for (int i = 0; i < nums.size() - 1; ++i){ if (nums[i] > nums[ 阅读全文

摘要： class Solution { public: int mySqrt(int x) { long a = x; while (a * a > x){ a = (a + x / a) / 2; } return a; } }; 阅读全文