p26

发表于 | 分类于 |

LeetCode 26 Remove Duplicates from Sorted Array 题解

1.题目：

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.
Subscribe to see which companies asked this question

题意：

输入一个有序数组，去除数组中重复的元素，并输出最后的元素个数。

2.解题思路:

见代码

3.代码

[title] [] [url] [link text]
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
 

public class Solution {
    public static int removeDuplicates(int[] nums) {
        int ans=1;
        if (nums.length<2)
        {
        	return nums.length;
        }
        for (int i=1;i<nums.length;i++)
        {
        	if (nums[i]!=nums[i-1])
        	{
        		nums[ans]=nums[i];
        		ans++;
        	}
        	
        }
        return ans;
    }
}

4.一些总结：