c++数组越界但是没有看出来

Question

leetcode 977.有序数组的平方

class Solution {
public:
    vector<int> sortedSquares(vector<int>& nums) {//肯定是循环的时候数组越界了
        int left = 0;
        int right = 0;
        int n = nums.size();
        while (left < n) {//找到第一个非负数
            if (nums[left] < 0) {
                ++left;
            }else {
                right = left;
                left = right - 1;
                break;
            }
        }
        vector<int> ans;
        while (left >= 0 || right < n) {
            int leftSquare = nums[left] * nums[left];
            int rightSquare  = nums[right] * nums[right];
            if (left < 0) {//没有负数，right = 0；
                ans.push_back(rightSquare);
                ++right;
            }else if (right == n) {//没有正数，right = n；
                ans.push_back(leftSquare);
                --left;
            }else if (leftSquare < rightSquare) {
                ans.push_back(leftSquare);
                --left;
            }else {
                ans.push_back(rightSquare);
                ++right;
               }
        }
        return ans;
    }
};

Answer 1

最好是加一个条件,

if(left<=right){

 

}

这样就不会越界了。

left有可能>n的