zoukankan      html  css  js  c++  java
  • Leetcode | Remove Duplicates from Sorted Array I && II

    Remove Duplicates from Sorted Array I

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

    这道题很简单,就是维护一个新数组的尾指针,tail,把去重后的数放到A[tail]就行,最终返回tail。

     1 class Solution {
     2 public:
     3     int removeDuplicates(int A[], int n) {
     4         if (n <= 1) return n;
     5         int tail = 0, v;
     6         
     7         for (int i = 0; i < n;) {
     8             v = A[i];
     9             for (i++; i < n && A[i] == v; ++i);
    10             A[tail++] = v;
    11         }
    12         return tail;
    13     }
    14 };

    Remove Duplicates from Sorted Array II

    Follow up for "Remove Duplicates":
    What if duplicates are allowed at most twice?

    For example,
    Given sorted array A = [1,1,1,2,2,3],

    Your function should return length = 5, and A is now [1,1,2,2,3].

    同上,区别在于,去重的时候,允许有两个重复的数;多的话还是略掉。

     1 class Solution {
     2 public:
     3     int removeDuplicates(int A[], int n) {
     4         if (n <= 1) return n;
     5         int tail = 0, v, j = 0;
     6         
     7         for (int i = 0; i < n;) {
     8             v = A[i];
     9             for (j = 0; j < 2 && i + j < n && A[i + j] == v; ++j) {
    10                 A[tail++] = v;
    11             }
    12             for (i += j; i < n && A[i] == v; ++i);
    13         }
    14         return tail;
    15     }
    16 };

    哈哈,Leetcode第一遍至此结束了!!!!cheers!

  • 相关阅读:
    PAT(B) 1037 在霍格沃茨找零钱(Java)
    PAT(B) 1043 输出PATest(Java)统计
    PAT(B) 1063 计算谱半径(Java)
    绘制虚线
    contentMode
    数字签名是什么
    动态设置 button的 name 的话 闪动的问题 解决
    setValuesForKeysWithDictionary 的用法
    获得 当前时间
    iOS 键盘类型
  • 原文地址:https://www.cnblogs.com/linyx/p/3735563.html
Copyright © 2011-2022 走看看