zoukankan      html  css  js  c++  java
  • 数组去重

    class Solution {
        public int removeDuplicates(int[] nums) {
           
            if(nums.length==0)
                return 0;
            int i=0;
            for(int j=1;j<nums.length;j++)
            {
                if(nums[j]!=nums[i])
                {
                    i++;
                    nums[i]=nums[j];
                }
            }
            return i+1;
        }
       
    }

    --------------------------------------------------------------------------

    public class MainClass {
        public static int[] stringToIntegerArray(String input) {
            input = input.trim();
            input = input.substring(1, input.length() - 1);
            if (input.length() == 0) {
              return new int[0];
            }
       
            String[] parts = input.split(",");
            int[] output = new int[parts.length];
            for(int index = 0; index < parts.length; index++) {
                String part = parts[index].trim();
                output[index] = Integer.parseInt(part);
            }
            return output;
        }
       
        public static String integerArrayToString(int[] nums, int length) {
            if (length == 0) {
                return "[]";
            }
       
            String result = "";
            for(int index = 0; index < length; index++) {
                int number = nums[index];
                result += Integer.toString(number) + ", ";
            }
            return "[" + result.substring(0, result.length() - 2) + "]";
        }
       
        public static String integerArrayToString(int[] nums) {
            return integerArrayToString(nums, nums.length);
        }
       
        public static void main(String[] args) throws IOException {
            BufferedReader in = new BufferedReader(new InputStreamReader(System.in));
            String line;
            while ((line = in.readLine()) != null) {
                int[] nums = stringToIntegerArray(line);
               
                int ret = new Solution().removeDuplicates(nums);
                String out = integerArrayToString(nums, ret);
               
                System.out.print(out);
            }
        }
    }

  • 相关阅读:
    内部排序一
    安全的文件访问方式
    Json序列化
    对进度条的通用封装实现
    关于'//'解答
    jquery中美元符号($)命名冲突
    linux 文件属性与权限
    【层次查询】Hierarchical Queries之亲兄弟间的排序(ORDER SIBLINGS BY)
    How to create a freehand tool
    C# 获取COM对象 ProgId ClsId
  • 原文地址:https://www.cnblogs.com/xlhlx/p/10662953.html
Copyright © 2011-2022 走看看