【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 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.

二.我的解题思路

题目要求去除重复的字符,我采取的办法是设立两个指针,一个指向当前重复字符的第一个,一个指向当前在遍历的字符。测试通过的程序如下:
class Solution {
public:
    int removeDuplicates(vector<int>& nums) {
        int len = nums.size();int cnt=1;int st=0;
        if(len<2) return len;
        for(int i=1;i<len;i++){
            if(nums[i]!=nums[i-1]){
                cnt++;
                if(st<i-1){
                    nums[st+1]=nums[i];
                    
                }
                st++;
            }
           
                
        }
    return cnt;
    }
};


阅读更多
个人分类: Leetcode 算法练习
想对作者说点什么? 我来说一句

没有更多推荐了,返回首页

加入CSDN,享受更精准的内容推荐,与500万程序员共同成长!
关闭
关闭