qq_53217755的博客

class Solution {public: int removeDuplicates(vector<int>& nums) { if(nums.size()<=1) { return nums.size(); } int next=1; int sz=nums.size(); int prev=0; int cur=0; while...

二分法class Solution {public: int mySqrt(int x) { int l = 0, r = x, ans = -1; while (l <= r) { int mid = l + (r - l) / 2; if ((long long)mid * mid <= x) { ans = mid; l = m