【LeetCode】Remove Element
来源:互联网 发布:3w咖啡盈利模式 知乎 编辑:程序博客网 时间:2024/06/06 05:23
题目:
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) { int num=0; int len=A.length; for(int i=0;i<len;i++){ if(A[i]!=elem) A[num++]=A[i]; } return num; }}
---EOF---
0 0
- 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
- 【LeetCode】Remove Element
- ASP.NET设计网络硬盘之两重要类
- c++11 stl atomic_flag 例子
- 设计模式分类
- 图片上传到数据库中
- 格式提示文字
- 【LeetCode】Remove Element
- VC6.0/MFC check box的获取对象的方法(部分)->针对初学者
- 获取特定的字符串
- Convert integer to string(int类型转化为string类型)
- 解析“extern”
- 动态规划 积木游戏
- 矩阵 uva 12037
- 51杂学
- 修改,编译sqoop