Leetcode-Remove Element
2014-11-29 09:58
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.
Solution:
The order of elements can be changed. It doesn't matter what you leave beyond the new length.
Solution:
public class Solution { public int removeElement(int[] A, int elem) { int head = 0; int end = A.length-1; while (head<end){ while (head<A.length && A[head]!=elem) head++; if (head>=end) break; while (end>=0 && A[end]==elem) end--; if (head>=end) break; int temp = A[head]; A[head] = A[end]; A[end] = temp; } int len = A.length; for (int i=0;i<A.length;i++) if (A[i]==elem){ len = i; break; } return len; } }
相关文章推荐
- leetcode: Remove Element
- [leetcode] Remove Element
- Leetcode[27]-Remove Element
- LeetCode-Remove Element
- Leetcode: Remove Element
- leetcode27~Remove Element
- leetcode 39: Remove Element
- [LeetCode] Remove Element
- 【leetcode】Remove Element
- [LeetCode]Remove Element
- [LeetCode] Remove Element 移除元素
- Leetcode - Pointers/Array - Remove Element
- 【Leetcode】Remove Element
- LeetCode | Remove Element
- LeetCode——Remove Element
- leetcode_Remove Element
- [LeetCode] 27 Remove Element
- [leetcode 27] Remove Element
- LeetCode刷题笔录 Remove Element
- Leetcode-Remove Element