27. Remove Element
来源:互联网 发布:种植药材前景 知乎 编辑:程序博客网 时间:2024/06/10 17:41
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.
Solution:
Tips:
if find target value in array from left to right, then find a non-target value from right to left, then swap them.
Java Code:
public class Solution { public int removeElement(int[] nums, int val) { if (null == nums) { // null check return 0; } int left = 0; int right = nums.length; while (left < right) { if (nums[left] == val) { if (nums[right - 1] == val) { right--; } else { nums[left] = nums[right - 1]; left++; right--; } } else { left++; } } return left; }}
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
- 485. Max Consecutive Ones
- Ubuntu 16.10 小记
- java中奇葩异常一
- LeetCode部分题解
- zip、enumerate
- 27. Remove Element
- 有序关联容器
- 3月25日 C4(华中赛区,郑轻)参赛感想
- Tensorflow安装
- 登录界面
- JVM你必需知道的基础
- C++ Primer_4th第六章学习笔记
- Josephus问题总结
- rocketMQ 消息查询(id,key) 运维命令以及java API的用法