如何在Java中对字符串数组(以数字连接的名称形式)进行排序?

时间:2016-11-25 05:32:42

标签: java arrays string sorting comparator

如果我有以下格式的字符串数组 -

  

[“synthia 16”,“alicia 3”,“alicia 2”,“alicia 1”,“synthia 2”]

列表首先按名称排序,然后按以下号码排序。排序的输出应该是 -

  

[“alicia 1”,“alicia 2”,“alicia 3”,“synthia 2”,“synthia 16”]

我使用comaparator使用Java执行此操作:

import java.util.Comparator;
import java.util.Arrays;

public class SortList {

public static void main ( String[] args) {
    String[] names = {"synthia 16", "alicia 4", "alicia 19", "alicia 1", "synthia 2"};
    System.out.println("Unsorted list:\n ");        
    displayList(names);

    Arrays.sort(names, new nameComparator());
    System.out.println("\nSorted list:\n");
    displayList(names);
}

public static void displayList(String[] names) {
    for(String name:names) {
        System.out.println(name);
    }
}

private static class nameComparator implements Comparator<String> {
    @Override
    public int compare(String s1, String s2) {
        String[] s1NameNumPair = s1.split(" ");
        String[] s2NameNumPair = s2.split(" ");
        if (s1NameNumPair[0].compareTo(s2NameNumPair[0]) > 1) {
            return 1;
        } else if (s1NameNumPair[0].compareTo(s2NameNumPair[0]) < 1) {
            return -1;
        } else {
            Double n1 = Double.parseDouble(s1NameNumPair[1]);
            Double n2 = Double.parseDouble(s2NameNumPair[1]);
            if (n1 > n2) { return 1; }
            else if (n1 < n2) { return -1; }
            else { return 0; }                
        }
    }
}
}

但是,使用这样的比较器只能按名称的字母顺序对数组进行排序。这是此代码生成的输出:

Unsorted list:

synthia 16
alicia 4
alicia 19
alicia 1
synthia 2

Sorted list:

alicia 1
alicia 19
alicia 4
synthia 2
synthia 16

如何获得正确的排序输出?

4 个答案:

答案 0 :(得分:4)

您必须检查> 0< 0,以便== 0转到其他位置, 尝试以下

if (s1NameNumPair[0].compareTo(s2NameNumPair[0]) > 0) {
    return 1;
} else if (s1NameNumPair[0].compareTo(s2NameNumPair[0]) < 0) {
    return -1;
} else {
    Double n1 = Double.parseDouble(s1NameNumPair[1]);
    Double n2 = Double.parseDouble(s2NameNumPair[1]);
    return n1.compareTo(n2);
}

答案 1 :(得分:2)

将您的tree.size()更改为:

nameComparator

答案 2 :(得分:1)

请更改比较如下。

private static class nameComparator implements Comparator<String> {
    @Override
    public int compare(String s1, String s2) {
        String[] s1NameNumPair = s1.split(" ");
        String[] s2NameNumPair = s2.split(" ");
        if (s1NameNumPair[0].compareTo(s2NameNumPair[0]) > 1) {
            return 1;
        } else if (s1NameNumPair[0].compareTo(s2NameNumPair[0]) < 0) { //here it should be <0 not <1
            return -1;
        } else {
            Double n1 = Double.parseDouble(s1NameNumPair[1]);
            Double n2 = Double.parseDouble(s2NameNumPair[1]);
            if (n1 > n2) {
                return 1;
            } else if (n1 < n2) {
                return -1;
            } else {
                return 0;
            }
        }
    }
}

答案 3 :(得分:1)

你可以使用这样的比较器:

  1. Java 7

    Comparator<String> comparator = new Comparator<String>() {
    @Override
    public int compare(String o1, String o2) {
        String[] strings1 = o1.split("\\s+");
        String[] strings2 = o2.split("\\s+");
        int firstCompare = strings1[0].compareTo(strings2[0]);
        int secondCompare = Integer.valueOf(strings1[1]).compareTo(Integer.valueOf(strings2[1]));
    
        return firstCompare*2 + secondCompare;
    }
    

    };

  2. Java 8

    Comparator<String> comparator =
    (String o1, String o2)-> {
        String[] strings1 = o1.split("\\s+");
        String[] strings2 = o2.split("\\s+");
        int firstCompare = strings1[0].compareTo(strings2[0]);
        int secondCompare = Integer.valueOf(strings1[1]).compareTo(Integer.valueOf(strings2[1]));
    
        return firstCompare*2 + secondCompare;
    };