26. Remove Duplicates from Sorted Array
2017-06-22 18:49
225 查看
题目描述
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.
思路
数组已排序,删除重复的值使每一个值只出现一次,返回新的数组长度。不要开辟额外的数组空间。class Solution { public: int removeDuplicates(vector<int>& A) { int i, j, n; int t = 0;//记录放下来的不重复的值的下标 n = A.size(); if(n == 0) return 0; for(i = 0; i < n-1;i++) { for(j = i+1; j < n; j++) { if(A[i] != A[j])//第一次不相等 { t++; A[t] = A[j]; break; } } i = j-1; } return t+1; } };
相关文章推荐
- LeetCode OJ 26 Remove Duplicates from Sorted Array
- [leetCode]26. Remove Duplicates from Sorted Array
- leetcode-26. Remove Duplicates from Sorted Array
- [Leetcode 26, easy] Remove Duplicates from Sorted Array
- leetcode--26. Remove Duplicates from Sorted Array
- leetCode 26.Remove Duplicates from Sorted Array(删除数组反复点) 解题思路和方法
- LeetCode(26)-- Remove Duplicates from Sorted Array
- 26. Remove Duplicates from Sorted Array
- Leetcode 26 Remove Duplicates from Sorted Array STL
- 【LeetCode】26. Remove Duplicates from Sorted Array
- LeetCode: 26. Remove Duplicates from Sorted Array
- 26. Remove Duplicates from Sorted Array
- LeetCode 26 Remove Duplicates from Sorted Array
- Leetcode 26 Remove Duplicates from Sorted Array
- LeetCode 26 Remove Duplicates from Sorted Array(从已排序数组中移除重复元素)
- LeetCode 26 - Remove Duplicates from Sorted Array
- [leetcode 26]Remove Duplicates from Sorted Array
- 26. Remove Duplicates from Sorted Array
- LeetCode(26)Remove Duplicates From Sorted Array
- LeetCode 26. Remove Duplicates from Sorted Array(java)