[LeetCode]27. Remove Element

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

Do not allocate extra space for another array, you must do this in place with constant memory.

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

Example:
Given input array nums = [3,2,2,3], val = 3

Your function should return length = 2, with the first two elements of nums being 2.

思路：双指针法

指针A指向数组的头部，指针B从数组的头部开始遍历，若B指向的值与val相等，则B后移；

否则A指向的位置修改为B 指向的位置，A,B均后移，直到遍历数组的全部元素

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