程序師世界是廣大編程愛好者互助、分享、學習的平台,程序師世界有你更精彩!
首頁
編程語言
C語言|JAVA編程
Python編程
網頁編程
ASP編程|PHP編程
JSP編程
數據庫知識
MYSQL數據庫|SqlServer數據庫
Oracle數據庫|DB2數據庫
 程式師世界 >> 編程語言 >> C語言 >> C++ >> C++入門知識 >> 26. Remove Duplicates from Sorted Array,duplicatessorted

26. Remove Duplicates from Sorted Array,duplicatessorted

編輯:C++入門知識

26. Remove Duplicates from Sorted Array,duplicatessorted


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.

 

 1 class Solution {
 2 public:
 3     int removeDuplicates(vector<int>& nums) {
 4         int len = nums.size();
 5         if(len == 0){
 6             return 0;
 7         }
 8         
 9         int j = 0;
10         for(int i = 1; i < len; i++){
11             if(nums[j] != nums[i]){
12                 nums[++j] = nums[i];
13             }
14         }
15         return j+1;
16     }
17 };

 

  1. 上一頁:
  2. 下一頁:
Copyright © 程式師世界 All Rights Reserved