class Solution:
	# @param A : list of integers
	# @return an integer
	def removeDuplicates(self, a):
		if (len(a) <= 1):
			return len(a)
		index = 1
		for i in xrange(1, len(a)):
			if a[i] != a[i-1]:
				a[index] = a[i]
				index += 1
		return index
"""

Remove duplicates from Sorted Array
Given a sorted array, remove the duplicates in place such that each element appears only once and return the new length.

Note that even though we want you to return the new length, make sure to change the original array as well in place

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],
Your function should return length = 2, and A is now [1,2]. 
"""