leetcode之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.(空间复杂度要求为O(1))

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.(最后只剩下两个2了，两个3被删除了)

问题来源：Remove Element(具体地址：https://leetcode.com/problems/remove-element/#/description)

思路：题目要求删除数组中和给定值val的元素，求剩余元素的数组长度，考虑对立面，题目就是要我们保留和val不相等的元素呗，问题转换一下就好解决了不是？

代码：

start和Remove Duplicates from Sorted Array(removeDuplicates方法)问题中的i是一个意思，都是用于计数的。