这里可能的混淆:

 return row1[columnToSort].compareTo(row2[columnToSort])

这是细微的比较,而不是数字比较。 如果你根据指示进行分类,那么你将获得与你的数字不同的结果——即“1”、“10”、“100”、“9”和1 9 100 100。

http://docs.oracle.com/javase/1.4.2/docs/api/java/lang/Integer.html Integer.parseInt,如果你能够把其余部分排除在外,就可自由地提出更多的问题。

stated子指出。 你们需要比较他们的内在价值,即你们需要在那里投放。

    int num1 = Integer.parseInt(row1[columnToSort]);
    int num2 = Integer.parseInt(row2[columnToSort]);
    if(num1 > num2)
            return 1;
    else 
            return 0;

比较法的位置 进行方法和检查。 收益报表按逆向顺序排列。

此外,在<代码>compare中添加了一些错误核对。 方法将使该守则更加有效。

在此处提供援助之后,奥基就是我们找到的解决办法。 再次感谢每个人的帮助! 希望以下法典有助于其他人。

班级法1 纽约总部

import java.io.*;
import java.util.Arrays;
import java.util.Scanner;

public class coordSort {
    @SuppressWarnings({ "unchecked" })
    public static void main (String args[]) throws IOException {

        String xCoordChar, yCoordChar;
        int xCoord, yCoord, coordSum;
        Scanner input = new Scanner(System.in);

        //Get x coordinate from user
        System.out.print("Enter x coordinate: ");
        xCoordChar = input.next();

        //Get x coordinate from user
        System.out.print("Enter y coordinate: ");
        yCoordChar = input.next();

        boolean sort = false;

        char[] a = xCoordChar.toCharArray();
        char[] b = yCoordChar.toCharArray();

        //validate user input is a digit 
        if ( (Character.isDigit(a[0]))  ) {     
            if(Character.isDigit(b[0]) ){
                //digits entered - begin processing all coordinate values
                sort = true;
            }
        }

        //If validation failed, inform user
        if(!sort){
            System.out.println("Please enter a positive numeric value.");
        }

        if(sort){       
            //Parse user input characters to Integers
            xCoord = Integer.parseInt(xCoordChar);
            yCoord = Integer.parseInt(yCoordChar);

            //determine SUM of user entered coordinates
            coordSum = xCoord + yCoord;

            //define coordinate array
            int[][] coordUnsortedArray = new int[26][3];
            int counter;
            int commaCount;
            String xCoordIn, yCoordIn;
            int intXCoordIn, intYCoordIn, sumCoordIn, coordDiff;

            //define input file
            FileInputStream fileIn = new FileInputStream("coords.txt");
            BufferedReader reader = new BufferedReader(new InputStreamReader    (fileIn)); 

            for (int j = 0; j < coordUnsortedArray.length; j++){
                counter = 0;
                commaCount = 0;
                //line from file to variable
                String coordSet = reader.readLine();     

                //look for the second "," to determine end of x coordinate
                for(int k = 0; k < coordSet.length(); k++){
                    if (coordSet.charAt(k) ==  , ) {
                        commaCount++;
                        counter++;
                        if (commaCount == 2){
                            break;
                        }
                    }else{
                        counter++;
                    }
                }

                //define x coordinate
                xCoordIn = (coordSet.substring(2,(counter - 1)));
                intXCoordIn = Integer.parseInt(xCoordIn);

                //define y coordinate
                yCoordIn = (coordSet.substring((counter),coordSet.length()));
                intYCoordIn = Integer.parseInt(yCoordIn);

                //coordinate calculations
                sumCoordIn = Integer.parseInt(xCoordIn) + Integer.parseInt    (yCoordIn);
                coordDiff = sumCoordIn - coordSum;

                if (coordDiff < 0){
                    coordDiff = coordDiff * (-1);
                }

                //load results to array
                coordUnsortedArray[j][0] = intXCoordIn;
                coordUnsortedArray[j][1] = intYCoordIn;
                coordUnsortedArray[j][2] = coordDiff;                           
            }             

            fileIn.close();
            System.out.print("
");
            System.out.println("Array Before Sorting:");
            System.out.println("=====================");

            //Array Before Sorting
            for(int i = 0; i < coordUnsortedArray.length; i++){
                int[] row = coordUnsortedArray[i];
                System.out.print((i + 1) + ") ");
                for(int j = 0; j < (row.length - 1); j++) {
                    coordUnsortedArray[i][j] = row[j];
                    if(j < 1){
                        System.out.print(coordUnsortedArray    [i]    [j] + ",");   
                    }else{
                        System.out.println(coordUnsortedArray    [i]    [j]);
                    }
                }
            }

            System.out.print("
");
            System.out.print("
");

            //Sort array coordDiff, column 3
            Arrays.sort(coordUnsortedArray, new ColumnComparator(2));

            System.out.println("Array After Sorting:");
            System.out.println("====================");

            //Original Array After Sorting
            for(int i = 0; i < coordUnsortedArray.length; i++){
                int[] row = coordUnsortedArray[i];
                System.out.print((i + 1) + ") ");
                for(int j = 0; j < (row.length - 1); j++) {
                    coordUnsortedArray[i][j] = row[j];
                    if(j < 1){
                        System.out.print(coordUnsortedArray[i][j] + ",");   
                    }else{
                        System.out.println(coordUnsortedArray    [i]    [j]);
                    }
                }
            }
            }
        }
}

第2类 纽约总部

import java.util.Comparator;

@SuppressWarnings("rawtypes")
class ColumnComparator implements Comparator {
int columnToSort;
ColumnComparator(int columnToSort) {
this.columnToSort = columnToSort;
}

//Compare method
public int compare(Object o1, Object o2) {
    int[] row1 = (int[]) o1;
    int[] row2 = (int[]) o2;

    int intRow1 = (row1[columnToSort]);
    int intRow2 = (row2[columnToSort]);

    return new Integer(intRow1).compareTo(new Integer(intRow2));
}
}