Leetcode26. Remove Duplicates from Sorted Array

题目：

<p style="box-sizing: border-box; margin-top: 0px; margin-bottom: 10px; color: rgb(51, 51, 51); font-family: "Helvetica Neue", Helvetica, Arial, sans-serif; font-size: 14px;">Given a sorted array, remove the duplicates in place such that each element appear only <span style="box-sizing: border-box;">once</span> and return the new length.</p><p style="box-sizing: border-box; margin-top: 0px; margin-bottom: 10px; color: rgb(51, 51, 51); font-family: "Helvetica Neue", Helvetica, Arial, sans-serif; font-size: 14px;">Do not allocate extra space for another array, you must do this in place with constant memory.</p><p style="box-sizing: border-box; margin-top: 0px; margin-bottom: 10px; color: rgb(51, 51, 51); font-family: "Helvetica Neue", Helvetica, Arial, sans-serif; font-size: 14px;">For example,<br style="box-sizing: border-box;" />Given input array <span style="box-sizing: border-box;">nums</span> = <code style="box-sizing: border-box; font-family: Menlo, Monaco, Consolas, "Courier New", monospace; font-size: 12.6px; padding: 2px 4px; color: rgb(199, 37, 78); background-color: rgb(249, 242, 244); border-radius: 4px;">[1,1,2]</code>,</p><p style="box-sizing: border-box; margin-top: 0px; margin-bottom: 10px; color: rgb(51, 51, 51); font-family: "Helvetica Neue", Helvetica, Arial, sans-serif; font-size: 14px;">Your function should return length = <code style="box-sizing: border-box; font-family: Menlo, Monaco, Consolas, "Courier New", monospace; font-size: 12.6px; padding: 2px 4px; color: rgb(199, 37, 78); background-color: rgb(249, 242, 244); border-radius: 4px;">2</code>, with the first two elements of <span style="box-sizing: border-box;">nums</span> being <code style="box-sizing: border-box; font-family: Menlo, Monaco, Consolas, "Courier New", monospace; font-size: 12.6px; padding: 2px 4px; color: rgb(199, 37, 78); background-color: rgb(249, 242, 244); border-radius: 4px;">1</code> and <code style="box-sizing: border-box; font-family: Menlo, Monaco, Consolas, "Courier New", monospace; font-size: 12.6px; padding: 2px 4px; color: rgb(199, 37, 78); background-color: rgb(249, 242, 244); border-radius: 4px;">2</code> respectively. It doesn't matter what you leave beyond the new length.</p>

本题比较简单，但是，在考虑不同情况时，要考虑清楚。

（1）向量中没有元素,返回0。

（2）向量中元素个数为1，则直接返回1，原向量保持不变。

（3）向量中元素个数大于1，则对向量中元素进行遍历，进行如下操作，

利用2个变量num_nodp记录已经遍历的元素中不包含重复的数的数个数，<span style="font-family: Arial, Helvetica, sans-serif;">num_dp记录已经遍历的数的个数，</span>

遍历时，将第i个元素与第i+1个元素比较，如果相同，说明后一个为重复元素，<pre name="code" class="cpp">num_nodp++; num_dp++;<span style="font-family: Arial, Helvetica, sans-serif;">；</span>

<span style="font-family: Arial, Helvetica, sans-serif;">如果不同，说明为不重复元素，</span>

<pre name="code" class="cpp">num_dp++;

最后返回num_nodp的值即为不重复元素的个数。

class Solution {
public:
    int removeDuplicates(vector<int>& nums) {
        int num_nodp = 0, num_dp = 0;
		while (num_dp < nums.size()) {
			if (num_dp == 0) {
				nums[num_nodp] = nums[num_dp];
				num_nodp++; num_dp++;
			}
			else {
				if (nums[num_dp] != nums[num_dp - 1]) {
					nums[num_nodp] = nums[num_dp];
					num_nodp++; num_dp++;
				}
				else {
					num_dp++;
				}
			}	
		}		
		return num_nodp;
    }
};