LeetCode OJ算法题（二十六）：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 you leave beyond the new length.

解法：

这题也与前面一题大同小异，甚至更加简单，不需要实时更新重复元素，一样设置i，j分别指示遍历位置，以及真正应放的位置

public class No26_RemoveElement {public static void main(String[] args){System.out.println(removeElement(new int[]{2,3,3,2,5,3}, 3));}public static int removeElement(int[] A, int elem) {if(A.length <= 0) return 0;int i = 1;int j = 1;for(;i<A.length;i++){if(A[i] == elem){continue;}A[j++] = A[i];}        return j;    }}