zoukankan      html  css  js  c++  java
  • 1331. Rank Transform of an Array

    package LeetCode_1331
    
    import java.util.*
    import kotlin.collections.HashMap
    
    /**
     * 1331. Rank Transform of an Array
     * https://leetcode.com/problems/rank-transform-of-an-array/
     *
    Given an array of integers arr, replace each element with its rank.
    The rank represents how large the element is. The rank has the following rules:
    Rank is an integer starting from 1.
    The larger the element, the larger the rank. If two elements are equal, their rank must be the same.
    Rank should be as small as possible.
    
    Example 1:
    Input: arr = [40,10,20,30]
    Output: [4,1,2,3]
    Explanation: 40 is the largest element. 10 is the smallest. 20 is the second smallest. 30 is the third smallest.
    
    Example 2:
    Input: arr = [100,100,100]
    Output: [1,1,1]
    Explanation: Same elements share the same rank.
     * */
    class Solution {
        /*
        * solution: Array copy + HashMap, Time:O(nlogn), Space:O(n)
        * */
        fun arrayRankTransform(arr: IntArray): IntArray {
            val array = Arrays.copyOf(arr, arr.size)
            array.sort()
            //key: num, value: the index of this num in sorted array
            val map = HashMap<Int, Int>()
            for (item in array) {
                //avoid replace index if same num
                if (!map.contains(item)) {
                    map.put(item, map.size + 1)
                }
            }
            for (i in array.indices) {
                //update result by index
                array[i] = map.get(arr[i])!!
            }
            return array
        }
    }
  • 相关阅读:
    CCF201509-3 模板生成系统(100分)
    CCF201509-3 模板生成系统(100分)
    CCF201512-3 画图(100分)
    CCF201512-3 画图(100分)
    CCF201403-3 命令行选项(100分)
    CCF201403-3 命令行选项(100分)
    Java---jdk与jre的区别
    Java--- J2EE、Java SE、Java EE、Java ME 区别
    Java---java ee和j2ee
    Java---null
  • 原文地址:https://www.cnblogs.com/johnnyzhao/p/13944787.html
Copyright © 2011-2022 走看看