3.1leetcode 移除元素

新做题：

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

    }
}

my

class Solution {
    public int removeElement(int[] nums, int val) {
        int len = nums.length;
        int p = 0;
        int q = len-1;
        while(p <= q)
        {
            if(nums[p] == val && nums[q] == val)
            {
                q--;
            }
            else if(nums[p] == val && nums[q] != val)
            {
                int temp = nums[p];
                nums[p] = nums[q];
                nums[q] = temp;
                q--;
                p++;
            }
            else
                p++;
            System.out.println(p);
        }
        return p;
    }
}

参考

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