// Complete the missingWords function below.static List<String> missingWords(String s, String t) {//initializationHashMap<String, Integer> map = new HashMap<String, Integer>();//HashSet<String> set = new HashSet<String>();
        List<String> result = new ArrayList<String>();String[] s_words = s.split("\\s+");String[] t_words = t.split("\\s+");//add sfor (int i = 0; i < s_words.length; i++) {map.put(s_words[i], 1);}//add tfor (int j = 0; j < t_words.length; j++) {map.put(t_words[j], map.get(t_words[j]) + 1);}//returnfor (int i = 0; i < s_words.length; i++) {if (map.get(s_words[i]) == 1) {result.add(s_words[i]);}}return result;}

class Result {/** Complete the 'getMostVisited' function below.** The function is expected to return an INTEGER.* The function accepts following parameters:*  1. INTEGER n*  2. INTEGER_ARRAY sprints*/public static int getMostVisited(int n, List<Integer> sprints) {// Write your code here//initializationint[] count_steps = new int[n];Arrays.fill(count_steps, 0);//for loopfor (int pos = 0; pos < sprints.size() - 1; pos++) {//smaller or biggerif (sprints.get(pos) < sprints.get(pos + 1)) {for (int i = sprints.get(pos); i < sprints.get(pos + 1); i++) {count_steps[i]++;}}else {for (int i = sprints.get(pos + 1); i < sprints.get(pos); i++) {count_steps[i]++;}}}//get maxint max = count_steps[0];int index = 0;for (int i = 0; i < n; i++) {if (count_steps[i] > max) {max = count_steps[i];index = i;} }//returnreturn index;}}

package labs;import java.util.*;    public class Example1 {    public static void sort(int[][] ob, final int[] order) {    Arrays.sort(ob, new Comparator<Object>() {    public int compare(Object o1, Object o2) {    int[] one = (int[]) o1;    int[] two = (int[]) o2;    for (int i = 0; i < order.length; i++) {    int k = order[i];    if (one[k] > two[k]) {    return 1;    } else if (one[k] < two[k]) {    return -1;    } else {    continue;  //如果按一条件比较结果相等，就使用第二个条件进行比较。
                    }    }    return 0;    }    });   }    public static void main(String[] args) {    int array[][] = new int[][] {     { 12, 34, 68, 32, 9, 12, 545 },     { 34, 72, 82, 57, 56, 0, 213 },     { 12, 34, 68, 32, 21, 945, 23 },     { 91, 10, 3, 2354, 73, 34, 18 },    { 12, 83, 189, 26, 27, 98, 33 },     { 47, 23, 889, 24, 899, 23, 657 },     { 12, 34, 68, 343, 878, 235, 768 },     { 12, 34, 98, 56, 78, 12, 546 },     { 26, 78, 2365, 78, 34, 256, 873 } };    sort(array, new int[] {0});   //先根据第一列比较，若相同则再比较第二列for (int i = 0; i < array.length; i++) {    for (int j = 0; j < array[i].length; j++) {    System.out.print(array[i][j]);    System.out.print("\t");    }    System.out.println();    }    }
}