java 数组去掉重复元素

jalilzod

已于 2024-05-04 00:46:20 修改

阅读量138

点赞数 6

分类专栏：力扣文章标签：算法数据结构

于 2024-05-02 16:55:34 首次发布

本文链接：https://blog.csdn.net/jalilzod/article/details/138394816

版权

力扣专栏收录该内容

15 篇文章 0 订阅

订阅专栏

该文章介绍了一个编程问题，要求在给定非降序整数数组中删除重复元素，保持原始顺序，并返回唯一元素的数量。Solution类提供了实现这一功能的方法，通过异或操作检测并替换重复值，最后返回不重复元素的新数组大小。

摘要由CSDN通过智能技术生成

Given an integer array nums sorted in non-decreasing order, remove the duplicates in-place such that each unique element appears only once. The relative order of the elements should be kept the same. Then return the number of unique elements in nums.

Consider the number of unique elements of nums to be k, to get accepted, you need to do the following things:

Change the array nums such that the first k elements of nums contain the unique elements in the order they were present in nums initially. The remaining elements of nums are not important as well as the size of nums.
Return k.

class Solution {
    public int removeDuplicates(int[] nums) {
        if(nums.length==0)
          return 0;
        if(nums.length==1)
          return 1;
      
        int itter = 0;int k = 0;
        for(int i = 1;i<nums.length;i++){
            if(i==nums.length-1){
               int res = nums[i]^nums[itter];
            if(res==0){
             nums[i] = Integer.MAX_VALUE;
            } 

                itter++;
                i = itter+1;
                if(itter==nums.length-1)
                 break;
                if(nums[itter]==Integer.MAX_VALUE){
                    itter++;
                    i = itter+1;
                    if(itter==nums.length-1)
                      break;
                }

            }
            int res = nums[i]^nums[itter];
            if(res==0){
             nums[i] = Integer.MAX_VALUE;
            }
        }
        int []tmp = new int[nums.length];
        int j = 0;
        for(int i = 0;i<nums.length;i++){
            if(nums[i]!=Integer.MAX_VALUE)
                tmp[j++] = nums[i];
        }
    int size = 0;
    for(int i = 0;i<j;i++){
        nums[i] = tmp[i];
        size++;
    }

    return size;

    }
}