美文网首页LeetCode By Go
[LeetCode By Go 79]27. Remove El

[LeetCode By Go 79]27. Remove El

作者: miltonsun | 来源:发表于2017-09-01 10:11 被阅读8次

题目

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.

解题思路

题目要求把数组中等于val的值都去掉,然后返回新数组的长度
用i遍历数组,len2为新数组的索引,只记录不等于val的值

代码

func removeElement(nums []int, val int) int {
    len1 := len(nums)
    var len2 int
    for i := 0; i < len1; i++{
        if val != nums[i] {
            if len2 < i {
                nums[len2] = nums[i]
            }
            len2++
        }
    }
    nums = nums[:len2]
    return len2
}

相关文章

网友评论

    本文标题:[LeetCode By Go 79]27. Remove El

    本文链接:https://www.haomeiwen.com/subject/vuyhjxtx.html