首页 > 代码库 > Leetcode 线性表 Remove Duplicates from Sorted Array
Leetcode 线性表 Remove Duplicates from Sorted Array
本文为senlie原创,转载请保留此地址:http://blog.csdn.net/zhengsenlie
Remove Duplicates from Sorted Array
Total Accepted: 14789 Total Submissions: 46601Given 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 A = [1,1,2]
,
Your function should return length = 2
, and A is now [1,2]
.
思路:用下标i扫描旧数组,用下标j来保存新数组的尾部
如果旧数组的当前元素与新数组的最后一个元素相同,则继续扫描旧数组
如果不同,新数组的下标前移一们,将旧数组的当前元素赋给新数组,继续扫描旧数组
相关题目:
Remove Element
Remove Duplicates from Sorted List
Remove Duplicates from Sorted List II
Remove Duplicates from Sorted Array II
Remove Nth Node From End of List
class Solution { public: int removeDuplicates(int A[], int n) { int j = 0; for(int i = 1; i < n; i++){ if(A[i] != A[j]) A[++j] = A[i]; } if(n == 0) return 0; else return j + 1; } };
声明:以上内容来自用户投稿及互联网公开渠道收集整理发布,本网站不拥有所有权,未作人工编辑处理,也不承担相关法律责任,若内容有误或涉及侵权可进行投诉: 投诉/举报 工作人员会在5个工作日内联系你,一经查实,本站将立刻删除涉嫌侵权内容。