Coding

  27.   Remove Element Easy Given an integer array  nums  and an integer  val , remove all occurrences of  val  in  nums in-place . The order of the elements may be changed. Then return  the number of elements in  nums  which are not equal to  val . Consider the number of elements in  nums  which are not equal to  val  be  k , to get accepted, you need to do the following things: Change the array  nums  such that the first  k  elements of  nums  contain the elements which are not equal to  val . The remaining elements of  nums  are not important as well as the size of  nums . Return  k . Custom Judge: The judge will test your solution with the following code: int[] nums = [...]; // Input array int val = ...; // Value to remove int[] expectedNums = [...]; // The expected answer with correct length. // It is sorted with no ...

  26.   Remove Duplicates from Sorted Array Easy Given an integer array  nums  sorted in  non-decreasing order , remove the duplicates  in-place  such that each unique element appears only  once . The  relative order  of the elements should be kept the  same . Then return  the number of unique elements in  nums . Consider the number of unique elements of  nums  be  k , to get accepted, you need to do the following things: Change the array  nums  such that the first  k  elements of  nums  contain the unique elements in the order they were present in  nums  initially. The remaining elements of  nums  are not important as well as the size of  nums . Return  k . Custom Judge: The judge will test your solution with the following code: int[] nums = [...]; // Input array int[] expectedNums = [...]; // The expected answer with correct length int k = remove...