leetcode-Remove Element
2014-05-20 19:50
246 查看
Given an array and a value, remove all instances of that value in place and return the new length.
The order of elements can be changed. It doesn't matter what you leave beyond the new length.
思路:也是采用双指针思路
代码:int removeElement(int A[], int n, int elem) {
int p=0;
int q=0;
while(q<n)
{
if(A[q]!=elem)
{
A[p]=A[q];
++p;
}
++q;
}
return p;
}
The order of elements can be changed. It doesn't matter what you leave beyond the new length.
思路:也是采用双指针思路
代码:int removeElement(int A[], int n, int elem) {
int p=0;
int q=0;
while(q<n)
{
if(A[q]!=elem)
{
A[p]=A[q];
++p;
}
++q;
}
return p;
}
相关文章推荐
- [leetcode:python]27.Remove Element
- Leetcode 27 Remove Element
- [LeetCode]Remove Element
- leetcode_Remove Element
- [LeetCode] Remove Element 分析
- LeetCode | 27. Remove Element
- 【LeetCode】Remove Element
- leetcode题解-27. Remove Element
- [leetcode-27]Remove Element(C语言)
- LeetCode | Remove Element
- [LeetCode]Remove Element
- leetcode-27-Remove Element
- [LeetCode] 27 - Remove Element
- leetcode——27——Remove Element
- [LeetCode] Remove Element
- LeetCode-Remove Element
- LeetCode - 27. Remove Element
- Leetcode 27 Remove Element
- Leetcode c语言-Remove Element
- LeetCode_27---Remove Element