zoukankan      html  css  js  c++  java
  • 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].
    

      

    class Solution {
    public:
        int removeDuplicates(int A[], int n) {
            // Start typing your C/C++ solution below
            // DO NOT write int main() function
           int i, same = 0;
           for( i =1; i<n;i++)
           {
              if(A[i] == A[i-1])
                 same++;
                 else if(same != 0)
                     A[i-same] = A[i] ;
           }
    return n - same ; } };
    --------------------------------------------------------------------天道酬勤!
  • 相关阅读:
    不透明度
    浮动塌陷
    滑动门技术
    文本替换
    清除浮动
    浮动
    定位概述
    IE6中使用通用选择器模拟子选择器效果
    js对象
    bzoj:2049: [Sdoi2008]Cave 洞穴勘测
  • 原文地址:https://www.cnblogs.com/graph/p/3040774.html
Copyright © 2011-2022 走看看