[LeetCode27] Remove Element

Topic:

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.

Idea: Set two variables start and end while traversing from back to front, encountering an element equal to Val to swap the value of the array end and start position until End==start

Code:

 Public classSolution { Public intRemoveelement (int[] Nums,intval) {        intStart =0; intEnd =Nums.        Length; if(End = =0)            return 0;  while(Start <end) {            if(Nums[start] = =val) {                inttemp =Nums[start]; Nums[start]= nums[end-1]; Nums[end-1] =temp; End--; }            Else{Start++; }        }        returnend; }}

[LeetCode27] Remove Element