package com.fishercoder.solutions;

/**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.
 */

public class _27 {

  public static class Solution1 {
    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];
        }
      }
      return i;
    }
  }
}

@@ -35,480 +35,8 @@
 %0D%0A%0D%0A
-/**27. Remove Element%0D%0A%0D%0AGiven an array and a value, remove all instances of that value in place and return the new length.%0D%0A%0D%0ADo not allocate extra space for another array, you must do this in place with constant memory.%0D%0A%0D%0AThe order of elements can be changed. It doesn't matter what you leave beyond the new length.%0D%0A%0D%0AExample:%0D%0AGiven input array nums = %5B3,2,2,3%5D, val = 3%0D%0A%0D%0AYour function should return length = 2, with the first two elements of nums being 2.%0D%0A */%0D%0A%0D%0A
 publ
@@ -318,10 +318,11 @@
 %7D%0D%0A  %7D%0D%0A
-
 %7D
+%0D
 %0A

refactor 27