leetcode练习：26. Remove Duplicates from Sorted Array

今天真是郁闷啊(￣﹏￣；)，写了好几个题目都未果（难道是因为中午一直在上课吗?）

Given a sorted array, remove the duplicates in place such that each element appear only once and return the new length.

Do not allocate extra space for another array, you must do this in place with constant memory.

For example,
Given input array nums = [1,1,2],

Your function should return length = 2, with the first two elements of nums being 1 and 2 respectively. It doesn't matter what you leave beyond the new length.

 

这个题，刚开始做还真是懵逼，系统总是报错，后来才发现没有理解好题目的意思。

首先：不能开辟新的空间（它会去检查传入数组，是不是按照它要求的那样，也就是前面是排好序的不重复的数字），其次返回是不重复数字的个数。

/**
 * @param {number[]} nums
 * @return {number}
 */
var removeDuplicates = function(nums) {
    var len = nums.length;
    var res = 0;
    
    if(len==1){
        return 1;
    }
    
    res =1;
    for(var i=1;i<len;i++){
       if(nums[i] != nums[i-1] ){
           nums[res] = nums[i]; 
           res++;
        } else {
            continue;
        }
    }

    return res;
};