27. Remove Element

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 by modifying the input array in-place with O(1) extra memory.
The order of elements can be changed. It doesn’t matter what you leave beyond the new length.

Example:
Given nums = [3,2,2,3], val = 3,
Your function should return length = 2, with the first two elements of nums being 2.
题解：给定一个int数组，要求删除给定的数字，返回新数组的长度，要求不能创建新的内存空间。
方法一：利用双指针

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

方法二：找到给定数字后，将数组最后面的数字赋值给该位置上

public int removeElement(int[] nums, int val) {
      int i = 0;
      int n = nums.length;
      while (i < n) {
          if (nums[i] == val) {
              nums[i] = nums[n - 1];
              n--;
          } else {
             i++;
         }
     }
     return n;
    }