数组

• 数组二分查找

• 移除元素(双指针)

• 有序数组平方(双指针)

• 长度最小子数组(滑动窗口)

• 螺旋矩阵II(模拟)

• 区间和(前缀和)

移除元素

int removeElement(int* nums, int numsSize, int val) {
    for (int i=0; i<numsSize; i++)
    {
        if (nums[i] == val)
        {
            for (int j=i; j<numsSize-1; j++)
                nums[j] = nums[j+1];

            numsSize--;
            i--;
        }
    }

    return numsSize;
}

int removeElement(int* nums, int numsSize, int val) {
    for (int i=0; i<numsSize; i++)
    {
        if (nums[i] == val)
        {
            for (int j=i; j<numsSize-1; j++)
                nums[j] = nums[j+1];

            numsSize--;
            i--;
        }
    }

    return numsSize;
}

长度最小数组

滑动窗口

int minSubArrayLen(int target, int* nums, int numsSize){
    
    int minLength = INT_MAX;
    
    int sum = 0;

    int left = 0;
    int right = 0;

    for(right = 0; right < numsSize; right++) {

        sum = sum + nums[right];

        while(sum >= target)
        {
            //计算子数组长度
            int subLength = right - left + 1;

            minLength = subLength < minLength ? subLength : minLength;

            //向右收缩
            sum = sum - nums[left];
            left++;
        }
    }

    return minLength == INT_MAX ? 0 : minLength;
}