[Leetcode] 27. Remove Element
来源:互联网 发布:js array join方法 编辑:程序博客网 时间:2024/06/11 08:44
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.
public class Solution { public int removeElement(int[] A, int elem) { if(A == null || A.length == 0) return 0; int start = 0; int end = A.length - 1; while(start <= end){ if(A[start] == elem){ A[start] = A[end]; end--; } else { start++; } } return end + 1; }}
0 0
- [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
- Leetcode 27. Remove Element
- LeetCode 27. Remove Element
- 27. Remove Element LeetCode
- 【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
- leetcode 27. Remove Element
- [Leetcode] 25. Reverse Nodes in k-Group
- [Leetcode] 26. Remove Duplicates from Sorted Array
- [Leetcode]Largest Rectangle in Histogram
- Android ORM框架GreenDao的数据库版本管理
- 第四期POWER8大赛(计算质数)
- [Leetcode] 27. Remove Element
- C++中的class (2)
- [Leetcode] 28. Implement strStr()
- Unique Binary Search Trees II
- Candy
- Trapping Rain Water
- Binary Tree Maximum Path Sum
- Generate Parentheses
- 卸载 Cloudera Manager 5.1.x.和 相关软件【官网翻译:高可用】