leetcode练习题目
2015-05-02 17:39
429 查看
题目要求之用一个数组,只能用一个数组的题目往往指针是一个非常炫酷的使用,需要仔细考虑。
class Solution { public: int removeDuplicates(int A[], int n) { if(n < 2) return n; int currPtr = 0; for(int i = 1; i<n; i++) { if(A[currPtr] != A[i]) { A[++currPtr] = A[i]; } } return ++currPtr; } };
其实用两个数组也好
class Solution { public: int removeDuplicates(int A[], int n) { if(n < 2) return n; int B ;int j = 0; B[0]= A[0]; for(int i = 1; i<n; i++) { if(A[j] != A[i]) { A[++j] = A[i]; } } return ++j; } };
其实仔细想想是一样的,不开辟新数组是因为完全可以进行数组覆盖,因为两者的数字个数是完全不相同的,所以其实完全没有必要开辟新的数组。
相关文章推荐
- LeetCode Online Judge 题目C# 练习 - Implement strStr()
- LeetCode Online Judge 题目C# 练习 - Remove Duplicates from Sorted Array II
- LeetCode Online Judge 题目C# 练习 - Unique Paths II
- LeetCode Online Judge 题目C# 练习 - Add two number
- LeetCode Online Judge 题目C# 练习 - Length of Last Word
- LeetCode Online Judge 题目C# 练习 - Remove Duplicates from Sorted List
- LeetCode Online Judge 题目C# 练习 - Search for a Range
- LeetCode Online Judge 题目C# 练习 - Subsets
- LeetCode Online Judge 题目C# 练习 - Valid Number
- LeetCode Online Judge 题目C# 练习 - Remove Duplicates from Sorted List II
- LeetCode Online Judge 题目C# 练习 - Search in Rotated Sorted Array
- LeetCode Online Judge 题目C# 练习 - Simplify Path
- LeetCode Online Judge 题目C# 练习 - Subsets II
- LeetCode Online Judge 题目C# 练习 - Valid Parentheses
- LeetCode Online Judge 题目C# 练习 - Balanced Binary Tree
- LeetCode Online Judge 题目C# 练习 - Combination
- LeetCode Online Judge 题目C# 练习 - Divid Two Integer
- LeetCode Online Judge 题目C# 练习 - Regular Expression Matching
- LeetCode Online Judge 题目C# 练习 - Remove Element
- LeetCode Online Judge 题目C# 练习 - Search in Rotated Sorted Array II