在java中排序String的2D数组

时间:2011-02-21 09:05:33

标签: java arrays sorting multidimensional-array

我知道之前可能会问过这个问题,但我找不到合适的答案。所以说我有这个数组:

String [][] theArray = {{"james", "30.0"},{"joyce", "35.0"},{"frank", "3.0"}, {"zach", "34.0"}}

有没有办法按每个子元素的第二个元素对此数组进行降序排序。所以我会得到这样的东西。

theArray = {{"joyce", "35.0"},{"zach", "34.0"},{"james", "30.0"}, {"frank", "3.0"}}

谢谢你们

9 个答案:

答案 0 :(得分:8)

Arrays.sort(arr, comparator)与自定义比较器一起使用:

Arrays.sort(theArray, new Comparator<String[]>(){

    @Override
    public int compare(final String[] first, final String[] second){
        // here you should usually check that first and second
        // a) are not null and b) have at least two items
        // updated after comments: comparing Double, not Strings
        // makes more sense, thanks Bart Kiers
        return Double.valueOf(second[1]).compareTo(
            Double.valueOf(first[1])
        );
    }
});
System.out.println(Arrays.deepToString(theArray));

<强>输出:

  

[[joyce,35.0],[zach,34.0],[james,30.0],[frank,23.0]]


<强>请注意:

您将对传入的数组进行排序,Arrays.sort()将不会返回新数组(实际上它返回void)。如果需要排序副本,请执行以下操作:

String[][] theCopy = Arrays.copyOf(theArray, theArray.length);

theCopy上执行排序,而不是theArray

答案 1 :(得分:5)

您必须使用Arrays.sort() method。此方法以Comparator为参数。 sort方法委托给比较器,以确定是否必须将数组的一个元素视为更大,更小或等于另一个元素。由于外部数组的每个元素都是一个数组,因此比较器必须比较数组(字符串)。

必须根据第二个元素的值来比较数组。第二个元素是一个String,实际上代表一个双数。因此,您必须将字符串转换为数字,否则顺序将是词典(20之前为3)而不是数字。

因此比较器可能如下所示:

public class StrinArrayComparator implements Comparator<String[]> {
    @Override
    public int compare(String[] array1, String[] array2) {
        // get the second element of each array, andtransform it into a Double
        Double d1 = Double.valueOf(array1.[1]);
        Double d2 = Double.valueOf(array2.[1]);
        // since you want a descending order, you need to negate the 
        // comparison of the double
        return -d1.compareTo(d2);
        // or : return d2.compareTo(d1);
    }
}

答案 2 :(得分:3)

如果您想远离数组,这里的变体使用List<Record>RecordComparator implements Comparator<Record>

控制台:

joyce 35.0
zach 34.0
james 30.0
frank 23.0

代码:

import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collections;
import java.util.Comparator;
import java.util.List;

/** @see http://stackoverflow.com/questions/5064027 */
public class ComparatorTest {
    public static void main(String[] args) {
        List<Record> list = new ArrayList<Record>(Arrays.asList(
            new Record("james", "30.0"),
            new Record("joyce", "35.0"),
            new Record("frank", "23.0"),
            new Record("zach",  "34.0")));
        print(list, Sort.DESCENDING, Field.D);
    }

    private static void print(List<Record> list, Sort s, Field f) {
        RecordComparator rc = new RecordComparator(s, f);
        Collections.sort(list, rc);
        for (Record r : list) {
            System.out.println(r);
        }
    }
}

class Record {

    private String s;
    private Double d;

    public Record(String name, String number) {
        this.s = name;
        this.d = Double.valueOf(number);
    }

    @Override
    public String toString() {
        return s + " " + d;
    }

    public int compareTo(Field field, Record record) {
        switch (field) {
            case S: return this.s.compareTo(record.s);
            case D: return this.d.compareTo(record.d);
            default: throw new IllegalArgumentException(
                "Unable to sort Records by " + field.getType());
        }
    }
}

enum Sort { ASCENDING, DESCENDING; }

enum Field {

    S(String.class), D(Double.class);

    private Class type;

    Field(Class<? extends Comparable> type) {
        this.type = type;
    }

    public Class getType() {
        return type;
    }
}

class RecordComparator implements Comparator<Record> {

    private Field field;
    private Sort sort;

    public RecordComparator(Sort sort, Field field) {
        this.sort = sort;
        this.field = field;
    }

    @Override
    public final int compare(Record a, Record b) {
        int result = a.compareTo(field, b);
        if (sort == Sort.ASCENDING) return result;
        else return -result;
    }
}

答案 3 :(得分:2)

你好像住在object denial。那些内部数组看起来很像一个人的信息(有名字和一些价值,也许是分数)。

您要做的是编写一个自定义类来保存该信息:

public class Person {
  private final String name;
  private final double score;

  public Person(final String name, final double score) {
    this.name=name;
    this.score=score;
  }

  public String getName() {
    return name;
  }

  public double getScore() {
    return score;
  }
}

然后,当你想对它们进行排序时,你只需要实现一个Comparator<Person>来指定你希望它们如何排序:

public PersonScoreComparator implements Comparator<Person> {
  public int compare(Person p1, Person p2) {
    return Double.compare(p1.getScore(), p2.getScore());
  }
}

或者,您可以通过添加此方法让Person类本身实现Comparable<Person>

public int compareTo(Person other) {
  return Double.compare(getScore(), other.getScore());
}

答案 4 :(得分:0)

使用Arrays.toList()创建此数组的列表 - 使用java.lang.comparator设计比较器,并使用写入逻辑对每个偶数元素进行排序

答案 5 :(得分:0)

java.util.Arrays中有几种排序方法。其中两个采用自定义Comparator。只需提供一个比较内部数组的第二个元素的比较器。

答案 6 :(得分:0)

答案 7 :(得分:0)

public static void main(String [] args)     {

String Name[][]={{"prakash","kumar"},{"raj","kappor"},{"vinod","bhart"}};

String str[]=new String[2];


for(int j=0; j<Name.length;j++)
 {
     for (int i=0 ; i<2; i++)
     {
         str[i]=Name[j][i];
     }
 for(int i=0;i<str.length;i++)
 {
     for(int k=i+1;k<str.length;k++)
     {
         if(str[i].compareTo(str[k])>0)
         {
             String temp= str[i];
             str[i]=str[k];
             str[k]=temp;
         }

         }
     System.out.print(str[i]+ " ");
  }
 System.out.println();
 }



 }
}

答案 8 :(得分:0)

/**
     *
     * @param array - 2D array required to be arranged by certain column
     * @param columnIndex - starts from 0; this will be the main comparator
     * @param hasHeaders - true/false; true - ignore the first row. False -
     * first row it's also compared and arranged
     * @return - the new arranged array
     */
    private String[][] arrangeArray(String[][] array, int columnIndex, boolean hasHeaders) {
        int headersExists = 0;
        if (hasHeaders) {
            headersExists = 1;
        }
        for (int i = headersExists; i < array.length; i++) {
            for (int j = headersExists; j < array.length; j++) {
            if (array[i][columnIndex].compareTo(array[j][columnIndex]) < 0){
                String[] temp = array[i];
                array[i] = array[j];
                array[j] = temp;
            }
        }
    }
    return array;
}