[Leetcode] Remove Element

Given an array and a value, remove all instances of that value in place and return the new length.

The order of elements can be changed. It doesn ' t matter what are you leave beyond the new length.

This problem is also very simple, personally think, especially because only ask for remove, the order of orders has not changed (of course, if you want to try to do not change the order). Can be solved with a simple two pointer. An int is used to loop, and the other int is used to sort the remaining integers.

public class Solution {public    int removeelement (int[] nums, int val) {        int a = 0;        int b = 0;        if (nums.length==0) {            return 0;        }         while (b<nums.length) {            if (nums[b]!=val) {                Nums[a] = nums[b];                a++;            }                   b++;        }        return A;    }}

[Leetcode] Remove Element