27. Remove Element
来源:互联网 发布:centos 7如何引导win7 编辑:程序博客网 时间:2024/06/08 16:20
Given an array and a value, remove all instances of that value in place and return the new length.
Do not allocate extra space for another array, you must do this in place with constant memory.
The order of elements can be changed. It doesn't matter what you leave beyond the new length.
Example:
Given input array nums = [3,2,2,3]
, val = 3
Your function should return length = 2, with the first two elements of nums being 2.
class Solution { public int removeElement(int[] nums, int val) { int index=0; int num=nums.length; for(int i=0;i<num;i++){ if(nums[i]!=val){ int temp =nums[index]; nums[index]=nums[i]; nums[i]=temp; index++; } } return index; }}
思路与26题基本一致。
阅读全文
0 0
- [LeetCode]27.Remove Element
- LeetCode --- 27. Remove Element
- LeetCode 27.Remove Element
- [Leetcode] 27. Remove Element
- 27.Remove Element
- [Leetcode] 27.Remove Element
- 27. Remove Element
- 27. Remove Element
- 【leetcode】27. Remove Element
- 【leetcode】27. Remove Element
- 27. Remove Element
- 27. Remove Element
- 27. Remove Element
- Leetcode 27. Remove Element
- 27. Remove Element
- LeetCode 27. Remove Element
- 27. Remove Element LeetCode
- 27. Remove Element
- java微信公众号开发及源码分享
- 类似淘宝不规则九宫格
- HBase连接池技术
- CreateCompatibleDC
- ViewPager的setCurrentItem数值过大导致ANR异常
- 27. Remove Element
- 关于final修饰局部变量问题
- ERROR 1045 (28000): Access denied for user 'root'@'localhost' 错误
- rsync简介
- 针对多媒体的拥塞控制实验测试标准
- JavaScript:对象作为对象的属性名
- Java-BIO/NIO/AIO整理
- android 调试方法
- JAVA 算法(一)