LeetCode 126 Remove Element
来源:互联网 发布:防身甩棍淘宝网 编辑:程序博客网 时间:2024/05/05 09:00
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.
分析:
每次碰到相等的,就把当前最后一个放到当前位置,同时长度减1,继续检查此位置,直到不相等
public class Solution { public int removeElement(int[] A, int elem) { if(A == null || A.length == 0) return 0; int i=0; int len = A.length; while(i < len){ if(A[i] == elem){ A[i] = A[len-1]; len--; continue; } i++; } A = Arrays.copyOf(A, len); return A.length; }}
0 0
- LeetCode 126 Remove Element
- LeetCode:Remove Element
- LeetCode: Remove Element
- [Leetcode] Remove Element
- LeetCode: Remove Element
- leetcode 39: Remove Element
- [LeetCode] Remove Element
- Leetcode: Remove Element
- Leetcode:Remove Element
- Leetcode:Remove Element
- Leetcode:Remove Element
- [LeetCode]Remove Element
- LeetCode-Remove Element
- LeetCode - Remove Element
- LeetCode | Remove Element
- leetcode之Remove Element
- LeetCode - Remove Element
- LeetCode: Remove Element
- MultiByteToWideChar(char *转Unicode)
- 多线程Operation
- 【多线程】(二)Interlocked系列函数
- java面试题-HashMap原理
- 逆波兰表达式
- LeetCode 126 Remove Element
- 从命令行启动3ds max(带命令行选项)并加载执行MAXScript
- 【10月末总结】
- c语言中可变参数
- Unity3D-游戏退出
- 【跟我一起学Unity3D】做一个2D的90坦克大战之地图编辑器
- Linux MEDIAWIKI+APACHE+PHP架构维基网站建置
- 独家秘方学技术
- 利用Avro Bindings向Oracle NoSQL读写数据