[LeetCode]27. Remove Element【&26. Remove Duplicates from Sorted Array】

27 . Remove Element
Easy

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.

0ms:

public int removeElement(int[] nums, int val) {
        int p = 0;
        for(int i=0;i<nums.length;i++){
            while(i<nums.length&&nums[i]==val)
                i++;

            if(i==nums.length)
                break;
            nums[p]=nums[i];
            p++;
        }
        return p;
    }

26 . Remove Duplicates from Sorted Array
Easy

Given a sorted array, remove the duplicates in place such that each element appear only once and return the new length.

Do not allocate extra space for another array, you must do this in place with constant memory.

For example,
Given input array nums = [1,1,2],

Your function should return length = 2, with the first two elements of nums being 1 and 2 respectively. It doesn’t matter what you leave beyond the new length.