[LintCode/LeetCode] Remove Duplicates from Sorted Array I & II

NO IMAGE

Remove Duplicates from Sorted Array I

Problem

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.

Example

Given input array A = [1,1,2]

Remove Duplicates from Sorted Array II

Problem

Follow up for “Remove Duplicates”:
What if duplicates are allowed at most twice?

For example,
Given sorted array A = [1,1,1,2,2,3]