[leetcode] Remove Duplicates from Sorted Array
来源:互联网 发布:淘宝实名资料 编辑:程序博客网 时间:2024/04/25 16:05
Remove Duplicates from Sorted Array
class Solution {public: int removeDuplicates(int A[], int n) { if(n==0){ return 0; } int index=0; for(int i=1;i<n;i++){ if(A[index]!=A[i]){ A[++index]=A[i]; } } return index+1; }};
解法2
class Solution {public: int removeDuplicates(int A[], int n) { return(unique(A,A+n)-A); }};
0 0
- [leetcode][array] Remove Duplicates from Sorted Array
- 【Leetcode】【Array】Remove Duplicates from Sorted Array
- LeetCode: Remove Duplicates from Sorted Array
- LeetCode: Remove Duplicates from Sorted Array II
- [Leetcode] Remove Duplicates from Sorted Array
- [Leetcode] Remove Duplicates from Sorted Array II
- LeetCode: Remove Duplicates from Sorted Array
- LeetCode: Remove Duplicates from Sorted Array II
- [Leetcode] Remove Duplicates from Sorted Array II
- leetcode 35: Remove Duplicates from Sorted Array
- [LeetCode] Remove Duplicates from Sorted Array II
- [LeetCode] Remove Duplicates from Sorted Array
- Leetcode: Remove Duplicates from Sorted Array
- [leetcode] Remove Duplicates from Sorted Array II
- [LeetCode]Remove Duplicates from Sorted Array
- [LeetCode]Remove Duplicates from Sorted Array II
- [leetcode]Remove Duplicates from Sorted Array
- [leetcode]Remove Duplicates from Sorted Array II
- 在MySQL中使用init-connect与binlog来实现用户操作追踪记录
- POJ 1426 Find The Multiple (搜索)
- STL系列之五 priority_queue 优先级队列
- innerHTML和outerHTML
- STL系列之六 set与hash_set
- [leetcode] Remove Duplicates from Sorted Array
- uva714 - Copying Books(最大值最小化)
- 九度题目1109:连通图
- STL系列之七 快速计算x的n次幂 power()的实现
- POJ 3067 Japan—— 树状数组
- HDU2242 考研路茫茫——空调教室
- 3n+1b 备忘录方法
- 设计模式——之动态代理 笔记
- 深入研究Servlet线程安全性问题