Remove Element - LeetCode
2014-11-03 15:36
197 查看
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.
The order of elements can be changed. It doesn't matter what you leave beyond the new length.
class Solution { public: int removeElement(int A[], int n, int elem) { if (n == 0) return n; int update = 0;//当前不重复部分的长度 for(int i = 0; i < n;i++) { if(A[i] != elem) A[update++] = A[i]; } return update; } };
相关文章推荐
- leetcode:Remove Element + Imple…
- leetcode(4)remove-element
- leetcode Remove Element
- Remove Element [LEETCODE]
- LeetCode Remove Element
- LeetCode之Remove Element
- leetcode Remove Element
- Remove Element leetcode java
- leetcode_c++:Remove Element (027)
- leetCode 27.Remove Element (删除元素) 解题思路和方法
- LeetCode Remove Element
- LeetCode之Remove Element
- LeetCode(27)Remove Element
- LeetCode:Remove Element与vector:erase()
- Remove Element<leetcode>
- Remove Element_Leetcode_#27
- LeetCode:Remove Element(删除数组中的特定元素)
- 【LeetCode】27.Remove Element(Easy)解题报告
- 【LeetCode】27.Remove Element(Easy)解题报告
- 【LeetCode】2(7)Remove Element(Easy)