26. Remove Duplicates from Sorted Array
程序员文章站
2024-02-17 12:12:40
...
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.
2.分析
3.代码
int removeDuplicates(int* nums, int numsSize) {
if (0 == numsSize || NULL == nums) return 0;
int index = 0;
for (unsigned int i = 1; i < numsSize; ++i) {
if (nums[i] != nums[index]) {
nums[++index] = nums[i];
}
}
return index + 1;
}
上一篇: oracle数据库rman异地恢复
下一篇: php容易被异常使用的empty函数
推荐阅读
-
26. Remove Duplicates from Sorted Array
-
26. Remove Duplicates from Sorted Array
-
leetcode82: Remove Duplicates from Sorted ListII
-
【一天一道LeetCode】#26. Remove Duplicates from Sorted Array
-
LeetCode 83. Remove Duplicates from Sorted List
-
83. Remove Duplicates from Sorted List
-
LeetCode 83. Remove Duplicates from Sorted List
-
LeetCode 83. Remove Duplicates from Sorted List ***
-
Leetcode 83. Remove Duplicates from Sorted List
-
Leetcode No.26 Remove Duplicates from Sorted Array(c++实现)