Leetcode 27. Remove Element

本文介绍了一种高效的算法,用于在不使用额外空间的情况下,从数组中移除所有指定值的实例,并返回修改后的长度。通过遍历和交换元素的方式,实现了O(1)的额外内存消耗要求。

Questions
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.

Example 1:

Given nums = [3,2,2,3], val = 3,

Your function should return length = 2, with the first two elements of nums being 2.

It doesn’t matter what you leave beyond the returned length.

Answer

class Solution {
    public int removeElement(int[] nums, int val) {
    	int current_ind = 0;
    	for(int i =0;i<nums.length;i++){
			if(nums[i] !=val){
				nums[i]=nums[j];
				current_ind++;
			}
		}
		reuturn current_ind;
    }
}
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值