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

    思路:

      (1)虽然能AC,但是不对的思路:如果找到重复的数,就将其设置成一个很大的数,最后再排序一下,返回新的长度。

     1 class Solution {
     2     public int removeDuplicates(int[] nums) {
     3         if (nums.length<=1)
     4             return nums.length;
     5         int duplicate = 0;
     6         for (int i=0;i<nums.length-1;i++){
     7             if (nums[i]==nums[i+1]){
     8                 nums[i]=123456;
     9                 duplicate++;
    10             }
    11         }
    12         Arrays.sort(nums);
    13         return nums.length-duplicate;
    14     }
    15 }

      (2)正常的思路:如果有重复的元素,就跳过,然后把后面元素的值赋在重复的位置上

     1 class Solution {
     2     public int removeDuplicates(int[] nums) {
     3         if (nums.length<=1)
     4             return nums.length;
     5         int index = 0;
     6         for (int i=1;i<nums.length;i++){
     7             if (nums[i]!=nums[index]){
     8                 index++;
     9                 nums[index]=nums[i];
    10             }
    11         }
    12         return index+1;
    13     }
    14 }
  • 相关阅读:
    万能的everything彻底解决mysql问题
    乱码问题
    机器学习学习规划
    NG机器学习笔记
    书籍与博客
    技术规划
    反置数
    多个接口出现同名函数的处理-转
    接口-imploements-委托
    接口使用中,对象生命周期管理-转
  • 原文地址:https://www.cnblogs.com/David-Lin/p/7725828.html
Copyright © 2011-2022 走看看