Leetcode[26]-Remove Duplicates from Sorted Array
2016-04-15 19:22
399 查看
Link: https://leetcode.com/problems/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.
思路:须要额外加入一个新的变量pos。初始值为0。用来记录非反复元素的位置。从数组的第二个元素開始遍历,假设和前面的元素相等,则直接跳到下一个。假设不等,则将该数组的值赋值给++pos位,接着继续遍历下一个;
Code(c++):
做个简单的改动:
Python代码
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.
思路:须要额外加入一个新的变量pos。初始值为0。用来记录非反复元素的位置。从数组的第二个元素開始遍历,假设和前面的元素相等,则直接跳到下一个。假设不等,则将该数组的值赋值给++pos位,接着继续遍历下一个;
Code(c++):
class Solution { public: int removeDuplicates(vector<int>& nums) { int n = nums.size(); if(n==0) return 0; int pos = 0,i = 1; while(i < n){ if(nums[i] == nums[i-1]){ i++; }else{ nums[++pos] = nums[i++]; } } n = pos+1; nums.resize(n); return n; } };
做个简单的改动:
class Solution { public: int removeDuplicates(vector<int>& nums) { int n = nums.size(); if(n==0) return 0; int pos = 1,i = 1;//将pos从1開始 while(i < n){ if(nums[i] == nums[i-1]){ i++; }else{ nums[pos++] = nums[i++];//这里保持一致 } } n = pos; nums.resize(n); return n; } };
Python代码
class Solution(object): def removeDuplicates(self, nums): """ :type nums: List[int] :rtype: int """ n = len(nums) if n == 0: return 0 pos = 1;i = 1;count=0 while i < n: if nums[i] == nums[i-1]: i=i+1 count=count+1 else: nums[pos] = nums[i] pos = pos+1 i = i + 1 for i in range(count): nums.pop(-1) return len(nums)
相关文章推荐
- http模块初始化过程
- 实验5 数独游戏界面设计
- 面试题:java内存中的堆区和数据结构中的堆有什么区别
- hibernate persist update 方法没有正常工作(不保存数据,不更新数据)
- Android Launcher 启动简述 <2>
- MFC点击按钮跳出系统自带的文件选择框
- CodeForces 660F Bear and Bowling 4(斜率DP+二分)
- java并发:线程同步机制之计数器&Exechanger
- 如何用Swift实现一个好玩的弹性动画
- hdu 1102 Constructing Roads 最小生成树prim模板题
- Android--app启动 黑白屏问题 解决
- JAVA IO(一)
- redis 操作 hash 的测试
- 算法练习——ACM_1001_Exponentiation
- codeforces_333B_水过
- 1006. 换个格式输出整数 (15)
- 团队任务一详述
- Unity性能优化之Draw Call
- android实现自定义SwichButton
- 穷举法之水仙花数