leetcode 27. Remove Element

最新推荐文章于 2024-10-08 10:36:00 发布

荒原Plus

最新推荐文章于 2024-10-08 10:36:00 发布

阅读量123

点赞数

分类专栏： LeetCode 文章标签： leetcode 算法

本文链接：https://blog.csdn.net/weixin_39979073/article/details/84562656

版权

LeetCode 专栏收录该内容

12 篇文章 0 订阅

订阅专栏

昨天偷了个懒没有刷leetcode题目。懊悔不已。。。
今日份leetcode 27. Remove Element

Description:
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.

Example 2:
Given nums = [0,1,2,2,3,0,4,2], val = 2,
Your function should return length = 5, with the first five elements of nums containing 0, 1, 3, 0, and 4.
Note that the order of those five elements can be arbitrary.
It doesn’t matter what values are set beyond the returned 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.

这道题目和前面刚做的 283. Move Zeroes 几乎一样。我还是用的双指针来做的

class Solution {
    public int removeElement(int[] nums, int val) {
        int index = 0;
        for(int i=0;i<nums.length;i++){
            if(nums[i]!=val){
                nums[index++]=nums[i];                
            }
        }
        return index;        
    }
}

后来在评论区发现一个不错的方法

class Solution {
    public int removeElement(int[] A, int val) {
    int len = A.length;
    for (int i = 0 ; i< len; ++i){
        while (A[i]==val && i< len) {
            A[i]=A[--len];
        }
    }
    return len;
   }
}

思路是：从前往后找到与val相同的值，并把数组的最后一个元素赋给它，紧接着数组长度减1。这里要注意while (A[i]==val && i< len) ，是while不是if，即使数组“最后一个元素”也是val 也没有关系。