zoukankan      html  css  js  c++  java
  • Remove Duplicates from Sorted Array leetcode java

    题目:

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

    题解:

    题目关键字:数组,已排好序的,只能in place替换,不能用额外数组,并且要求结果返回unique的长度。

    题解方法是双指针,一个指针只记录unique的并且帮助记录长度,一个指针往前找。

    代码如下:

     1     public int removeDuplicates(int[] A) {
     2         if(A.length == 0 || A == null)
     3             return 0;
     4         
     5         int len = 1;
     6         for(int index = 1; index < A.length; index++){
     7             if(A[index] != A[index-1]){
     8                 if(A[index] != A[len])
     9                     A[len] = A[index];
    10                 len++;
    11             }
    12         }
    13         return len;
    14     }
  • 相关阅读:
    poj 3255
    (DP) bzoj 2091
    (最短路) bzoj 2118
    (点双联通分量) poj 2942
    (树直径) bzoj 1509
    (离线处理+BFS) poi Tales of seafaring
    (并查集+DFS) poi guilds
    (记忆话搜索)POI Fibonacci Representation
    (DP) POI Bytecomputer
    (DP) bzoj 1296
  • 原文地址:https://www.cnblogs.com/springfor/p/3871038.html
Copyright © 2011-2022 走看看