leetcode27

public class Solution {
    public int RemoveElement(int[] nums, int val) {
        var len = nums.Length;

            var count = 0;

            for (int i = 0; i < nums.Length; i++)
            {
                if (nums[i] != val)
                {
                    nums[count] = nums[i];
                    count++;
                }
            }
            return count;
    }
}

https://leetcode.com/problems/remove-element/#/description

 

补充Java的实现：

class Solution {
    public int removeElement(int[] nums, int val) {
        int i = 0,j = 0;
        while(j<nums.length){
            if(nums[j] == val){
                j++;
                continue;
            }else{
                nums[i] = nums[j];
                i++;
                j++;
            }
        }
        return i;
    }
}