leetcode:Remove Duplicates from Sorted Array

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

int RemoveDuplicates(int Array[], int n)
{
	if (0 == n) return 0;
	int index = 0;
	for (int i = 1; i < n; i++){ 
	   if (Array[index] != Array[i])
	      Array[++index] = Array[i];      
    }
    return index + 1;
}

int main()
{
	int n, length;
	//int A[] = {1,1,2};
	std::cin >> n;
	int *Array = new int[n];
	for(int i = 0;i<n;i++){
		std::cin>>Array[i];
	}
	length = RemoveDuplicates(Array,n);
	std::cout<<length;
	delete []Array;
	return 0;
}

疑问：求不重复数字长度好理解。但是A is now [1,2] ，这个就有点费解了。是在原始数组上变更，还是输出一个新的数组 [1,2]。如果是前者，数组的长度是固定的，这个改不了吧？如果是后者，这就需要额外的空间了。求大牛指点！