题目:Remove Duplicates from Sorted Array
Given a sorted array nums, 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 by modifying the input array in-place with O(1) extra memory.
Example 1:
Given 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 returned length.
Example 2:
Given nums = [0,0,1,1,1,2,2,3,3,4],
Your function should return length = 5, with the first five elements of nums being modified to 0, 1, 2, 3, and 4 respectively.
It doesn’t matter what values are set beyond the returned length.
统计已排序数组中不同元素的个数,并将所有不同的元素放到数组的最前面,例如:
nums = [0,0,1,1,1,2,2,3,3,4] 返回 5 并且修改数组的前5位为:0,1,2,3,4。代码还是比较简单的就不多做解释了。
static public int RemoveDuplicates(int[] nums)
{
int result = 1;
if (nums.Length == 0) return 0;
for (int i = 1; i < nums.Length; i++)
{
if (nums[i] != nums[i - 1])
{
nums[result] = nums[i];
result++;
}
}
return result;
}
相识的题目:Remove Element
Given an array nums and a value val, remove all instances of that value in-place and return the new length.
Do not allocate extra space for another array, you must do this by modifying the input array in-place with O(1) extra memory.
The order of elements can be changed. It doesn’t matter what you leave beyond the new length.
Example 1:
Given nums = [3,2,2,3], val = 3,
Your function should return length = 2, with the first two elements of nums being 2.
It doesn’t matter what you leave beyond the returned length.
Example 2:
Given nums = [0,1,2,2,3,0,4,2], val = 2,
Your function should return length = 5, with the first five elements of nums containing 0, 1, 3, 0, and 4.
Note that the order of those five elements can be arbitrary.
It doesn’t matter what values are set beyond the returned length.
输入int数组 nums[] 和一个值 val,剔除数组中的和val相等的元素值,返回剔除该值以后数组的长度n,数组的前n位就是剔除val以后的数组值。
static public int RemoveElement(int[] nums, int val)
{
int result = 0;
if (nums.Length == 0) return 0;
for (int i = 0; i < nums.Length; i++)
{
if (nums[i] != val)
{
nums[result] = nums[i];
result++;
}
}
return result;
}