LeetCode27——Remove Element
2015-02-11 15:20
330 查看
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.
难度系数:
容易
实现
[code]int removeElement(int A[], int n, int elem) { int cnt = 0; for (int i = 0; i < n - cnt; ++i) { if (elem == A[i]) { A[i] = A[n- 1 - cnt]; cnt++; i--; } } return n - cnt; }
相关文章推荐
- leetcode[27]:Remove Element
- LeetCode-27-Remove Element(C语言实现)
- leetcode 27: Remove Element
- LeetCode 27 - Remove Element
- LeetCode:27. Remove Element
- Leetcode 27 Remove Element
- LeetCode------27. Remove Element
- leetcode 27 Remove Element
- leetcode 27 Remove Element (C)
- leetcode-27-Remove Element
- LeetCode-27. Remove Element
- Leetcode----27 Remove Element
- LeetCode 27:Remove Element
- leetcode——27——Remove Element
- leetcode[27]Remove Element
- LeetCode 27---Remove Element
- leetcode27: Remove Element
- LeetCode(27)-Remove Element
- leetcode 27. Remove Element
- LeetCode 27. Remove Element