LeetCode 27. Remove Element

Given an array nums and a value val, 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 by modifying the input array in-place with O(1) extra memory.

The order of elements can be changed. It doesn't matter what you leave beyond the new length.

Clarification:

Confused why the returned value is an integer but your answer is an array?

Note that the input array is passed in by reference, which means modification to the input array will be known to the caller as well.

Tip:题目要求不得使用额外的储存空间,也就是空间复杂度为O(1),另外解释了为什么不需要返回数组

public class RemoveElementSolution {
    public int removeDuplicates(int[] nums, int val) {
        /**
         * 此题与26很相似,改的只是判断条件
         */

        int newLen = 0;//不重复数据的指针
        int oldLen = nums.length;

        for (int i = 0; i < oldLen; i++) {
            if (nums[i] != val) {
                nums[newLen++] = nums[i];
            }

        }

        return newLen;
    }
}

 

  • 1
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值