簡體   English   中英

根據值在地圖上排序

[英]sorting on map based on values

如何根據值對哈希圖進行排序, 如果值相同,則排序應在鍵上。

我嘗試使用比較器,但未給出預期的結果。

我希望結果像這樣

{Bajaj=8.0, Tata=7.99, Maruthi=6.34, Kmart=5.99, Honda=5.78, 
Adidas=4.99, Ford=3.99, Nike=3.99, Sears=3.99, Suzuki=3.99, 
Apple=2.99, Puma=1.99}

這是完整的源代碼:

import java.util.*;

public class Test {
    public static void main(String[] args) {

        HashMap<String, Double> map = new HashMap<String, Double>();
        ValueComparator bvc = new ValueComparator(map);
        TreeMap<String, Double> sorted_map = new TreeMap<String, Double>(bvc);

        map.put("Adidas", 4.99);
        map.put("Nike", 3.99);
        map.put("Puma", 1.99);
        map.put("Ford", 3.99);
        map.put("Apple", 2.99);
        map.put("Sears", 3.99);
        map.put("Kmart", 5.99);
        map.put("Tata", 7.99);
        map.put("Maruthi", 6.34);
        map.put("Honda", 5.78);
        map.put("Bajaj", 8.0);
        map.put("Suzuki", 3.99);

        System.out.println("unsorted map: " + map);

        sorted_map.putAll(map);

        System.out.println("results: " + sorted_map);
    }
}

class ValueComparator implements Comparator<String> {

    Map<String, Double> base;

    public ValueComparator(Map<String, Double> base) {
        this.base = base;
    }

    // Note: this comparator imposes orderings that are inconsistent with
    // equals.
    @Override
    public int compare(String a, String b) {
        if (base.get(a) > base.get(b)) {
            return -1;
        } else if (base.get(a) == base.get(b)) {
            System.out.println();
            if (a.compareTo(b) == -1) {
                return -1;
            } else if (a.compareTo(b) == 1) {
                return 1;
            } else {
                return 0;
            }
        } else {
            return 1;
        } // returning 0 would merge keys
    }
}

在這里,您的compare實現中有兩個問題。 首先,您將裝箱的Double值與==進行比較:

else if(base.get(a) == base.get(b))

您應該將其替換為

else if(base.get(a).equals(base.get(b)))

其次,您檢查a.compareTo(b)是否為-11類的特定值,但是它可能返回任何正/負數。 僅返回a.compareTo(b)的結果會更好,更簡單。 這是固定的compare方法:

public int compare(String a, String b) {
    if (base.get(a) > base.get(b)) {
        return -1;
    } else if (base.get(a).equals(base.get(b))) {
        return a.compareTo(b);
    } else {
        return 1;
    } // returning 0 would merge keys
}

如果要以不區分大小寫的方式對具有相同值的鍵進行排序,只需使用compareToIgnoreCase

public int compare(String a, String b) {
    if (base.get(a) > base.get(b)) {
        return -1;
    } else if (base.get(a).equals(base.get(b))) {
        return a.compareToIgnoreCase(b);
    } else {
        return 1;
    } // returning 0 would merge keys
}

由於排序順序依賴於值和鍵,因此請使用Map.Entry<String, Double>條目:

List<Map.Entry<String, Double>> entries = new ArrayList<>(base.entrySet());
Collections.sort(entries, new Comparator<Map<String, Double>>() {
    ...
});

只是有點扭曲了ValueComparator類的比較方法。 這將首先對值進行排序,如果值相同,則對鍵進行排序。 希望這可以幫助。 輸出如下所示:

未分類的地圖:{阿迪達斯= 4.99,巴賈傑= 8.0,蘋果= 2.99,福特= 3.99,彪馬= 1.99,塔塔= 7.99,耐克= 3.99,鈴木= 3.99,本田= 5.78,凱馬特= 5.99,瑪魯蒂= 6.34,西爾斯= 3.99}

結果:{Bajaj = 8.0,Tata = 7.99,Maruthi = 6.34,Kmart = 5.99,Honda = 5.78,Adidas = 4.99,Ford = 3.99,Nike = 3.99,Sears = 3.99,Suzuki = 3.99,Apple = 2.99,Puma = 1.99 }

import java.util.*;

public class SortValueMap {

    public static void main(String[] args) {

        HashMap<String, Double> map = new HashMap<String, Double>();
        ValueComparator bvc = new ValueComparator(map);
        TreeMap<String, Double> sorted_map = new TreeMap<String, Double>(bvc);

        map.put("Adidas", 4.99);
        map.put("Nike", 3.99);
        map.put("Puma", 1.99);
        map.put("Ford", 3.99);
        map.put("Apple", 2.99);
        map.put("Sears", 3.99);
        map.put("Kmart", 5.99);
        map.put("Tata", 7.99);
        map.put("Maruthi", 6.34);
        map.put("Honda", 5.78);
        map.put("Bajaj", 8.0);
        map.put("Suzuki", 3.99);

        System.out.println("unsorted map: " + map);

        sorted_map.putAll(map);

        System.out.println("results: " + sorted_map);
    }
}

class ValueComparator implements Comparator<String> {

    Map<String, Double> base;

    public ValueComparator(Map<String, Double> base) {
        this.base = base;
    }

    // Note: this comparator imposes orderings that are inconsistent with
    // equals.
    @Override
    public int compare(String a, String b) {
        if(base.get(a).compareTo(base.get(b)) != 0) {
            if (base.get(a) > base.get(b)) {
                return -1;
            } else { 
                return 1;
            }
        }
        return a.compareTo(b);
    }
}

暫無
暫無

聲明:本站的技術帖子網頁,遵循CC BY-SA 4.0協議,如果您需要轉載,請注明本站網址或者原文地址。任何問題請咨詢:yoyou2525@163.com.

 
粵ICP備18138465號  © 2020-2024 STACKOOM.COM