【LeetCode】求解：刪除排序數組中的重複項 疑問

刪除排序數組中的重複項

給定一個排序數組，你需要在原地刪除重複出現的元素，使得每個元素只出現一次，返回移除後數組的新長度。

不要使用額外的數組空間，你必須在原地修改輸入數組並在使用 O(1) 額外空間的條件下完成。

示例 1:

給定數組 nums = [1,1,2],

函數應該返回新的長度 2, 並且原數組 nums 的前兩個元素被修改爲 1, 2。

你不需要考慮數組中超出新長度後面的元素。

示例 2:

給定 nums = [0,0,1,1,1,2,2,3,3,4],

函數應該返回新的長度 5, 並且原數組 nums 的前五個元素被修改爲 0, 1, 2, 3, 4。

你不需要考慮數組中超出新長度後面的元素。

說明:

爲什麼返回數值是整數，但輸出的答案是數組呢?

請注意，輸入數組是以“引用”方式傳遞的，這意味着在函數裏修改輸入數組對於調用者是可見的。

你可以想象內部操作如下:

// nums 是以“引用”方式傳遞的。也就是說，不對實參做任何拷貝
int len = removeDuplicates(nums);

// 在函數裏修改輸入數組對於調用者是可見的。
// 根據你的函數返回的長度, 它會打印出數組中該長度範圍內的所有元素。
for (int i = 0; i < len; i++) {
printf(nums[i]);
}​

#include "stdio.h"

int removeDuplicates(int* nums, int numsSize)
{
    int i, k;
    int len = numsSize;

    if (nums == NULL || numsSize == 0) 
    {
	return 0;
    }

    for (i = 0; i < len;)
    {
        if (nums[i] == nums[i+1])
	{
	    for (k = i; k < len; k++) //將nums[j]後面的元素前移一位
		nums[k] = nums[k+1];
	    len--;
	}
        else
        {
            i++;
            continue;
        }
   }

   for (int i = 0; i < len; i++) 
   {
	printf("num[%d] = %d\n", i, nums[i]);
   }

   return len;

}

int main(void)
{
    //int t[] = { 0,0,2,3,3,3,4,4,5,5 };
    //int  t[] = {0, 0, 1, 1, 1, 2, 2, 3, 3, 4};
    int t[] = {1,1,2};
    printf("the result is %d\n", removeDuplicates(t, sizeof(t)/sizeof(t[0])));

    getchar();
    return 0;
}

程序在leetcode平臺運行總是報錯，沒找到原因，但在vs2017中就沒有報錯，請大家幫忙找找看看原因。

謝謝。

附帶leetcode平臺報錯信息

=================================================================
==29==ERROR: AddressSanitizer: heap-buffer-overflow on address 0x60200000001c at pc 0x00000040199a bp 0x7ffebf02e5f0 sp 0x7ffebf02e5e8
READ of size 4 at 0x60200000001c thread T0
    #2 0x7f733bb1d2e0 in __libc_start_main (/lib/x86_64-linux-gnu/libc.so.6+0x202e0)
0x60200000001c is located 0 bytes to the right of 12-byte region [0x602000000010,0x60200000001c)
allocated by thread T0 here:
    #0 0x7f733d3cc2b0 in malloc (/usr/local/lib64/libasan.so.5+0xe82b0)
    #3 0x7f733bb1d2e0 in __libc_start_main (/lib/x86_64-linux-gnu/libc.so.6+0x202e0)
Shadow bytes around the buggy address:
  0x0c047fff7fb0: 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00
  0x0c047fff7fc0: 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00
  0x0c047fff7fd0: 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00
  0x0c047fff7fe0: 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00
  0x0c047fff7ff0: 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00
=>0x0c047fff8000: fa fa 00[04]fa fa fa fa fa fa fa fa fa fa fa fa
  0x0c047fff8010: fa fa fa fa fa fa fa fa fa fa fa fa fa fa fa fa
  0x0c047fff8020: fa fa fa fa fa fa fa fa fa fa fa fa fa fa fa fa
  0x0c047fff8030: fa fa fa fa fa fa fa fa fa fa fa fa fa fa fa fa
  0x0c047fff8040: fa fa fa fa fa fa fa fa fa fa fa fa fa fa fa fa
  0x0c047fff8050: fa fa fa fa fa fa fa fa fa fa fa fa fa fa fa fa
Shadow byte legend (one shadow byte represents 8 application bytes):
  Addressable:           00
  Partially addressable: 01 02 03 04 05 06 07 
  Heap left redzone:       fa
  Freed heap region:       fd
  Stack left redzone:      f1
  Stack mid redzone:       f2
  Stack right redzone:     f3
  Stack after return:      f5
  Stack use after scope:   f8
  Global redzone:          f9
  Global init order:       f6
  Poisoned by user:        f7
  Container overflow:      fc
  Array cookie:            ac
  Intra object redzone:    bb
  ASan internal:           fe
  Left alloca redzone:     ca
  Right alloca redzone:    cb
==29==ABORTING