【Leetcode Algorithm】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.

public class Solution {    public int removeElement(int[] nums, int val) {        int j = 0;        //将与val不同的元素放到j的位置        for(int i=0;i<nums.length;i++){            if(nums[i]!=val){                nums[j++] = nums[i];            }        }        return j;    }}

此题和27题tRemove Duplicates from Sorted Array的解题思路是一致的，一定要不通过比较不同（nums[i]!=val）来思考，如果比较相同的元素就会走弯路