We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
  1. Prepare
  2. Java
  3. Data Structures
  4. Java Comparator
  5. Discussions

Java Comparator

Sort by

recency

|

275 Discussions

|

  • khadbadeamol
     + 0 comments

    import java.util.*;

    // Player class class Player { String name; int score;

    Player(String name, int score) {
    this.name = name;
    this.score = score;
}

    }

    // Checker class that implements Comparator class Checker implements Comparator { public int compare(Player a, Player b) { // First sort by descending score if (a.score != b.score) { return b.score - a.score; // higher score comes first } // If scores are equal, sort alphabetically by name return a.name.compareTo(b.name); } }

    public class Solution { public static void main(String[] args) { Scanner scanner = new Scanner(System.in); int n = scanner.nextInt();

        Player[] players = new Player[n];

    for (int i = 0; i < n; i++) {
        String name = scanner.next();
        int score = scanner.nextInt();
        players[i] = new Player(name, score);
    }

    scanner.close();

    // Use custom comparator to sort
    Arrays.sort(players, new Checker());

    // Print sorted result
    for (Player p : players) {
        System.out.println(p.name + " " + p.score);
    }
}

    }

  • spriyamalar
     + 0 comments

    class Checker implements Comparator { Comparator comp = (p1, p2) -> Integer.valueOf(p2.score).compareTo(Integer.valueOf(p1.score)); @Override public int compare(Player o1, Player o2) { return comp.thenComparing((p1,p2) -> p1.name.compareTo(p2.name)).compare(o1, o2); } }

  • yashdeora98294
     + 0 comments

    Here is Java Comparator solution - https://programmingoneonone.com/hackerrank-java-comparator-problem-solution.html

  • devashis_k2002
     + 0 comments
       public static class Student {
        String name;
        int marks;

        public Student(String name, int marks) {
            this.name = name;
            this.marks = marks;
        }

        @Override
        public String toString() {
            return ""+ name + " " + marks + "";
        }
    }

    public static class SortByName implements Comparator<Student> {
        @Override
        public int compare(Student o1, Student o2) {
            return o1.marks==o2.marks ? o1.name.compareTo(o2.name) : o2.marks-o1.marks;
        }

    }

    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        ArrayList<Student> list = new ArrayList<Student>();
        int size = scanner.nextInt();
        for(int i=0; i<size; i++){
            list.add(new Student(scanner.next(), scanner.nextInt()));
        }
        scanner.close();
        list.sort(new SortByName());
        list.stream().forEach(System.out::println);
    }

  • h2604952343
     + 0 comments
    import java.util.Map;
import java.util.Scanner;
import java.util.stream.Collectors;
import java.util.ArrayList;
import java.util.HashMap;

public class Solution {

    public static void main(String[] args) {
		/*
		 * Enter your code here. Read input from STDIN. Print output to STDOUT. Your
		 * class should be named Solution.
		 */
		Scanner sc = new Scanner(System.in);
		int size = sc.nextInt();
		sc.nextLine();
		var list = new ArrayList<Map<String, Integer>>();
		for (int i = 0; i < size; i++) {
			String[] str = sc.nextLine().split(" ");
			var map = new HashMap<String, Integer>();
			map.put(str[0], Integer.parseInt(str[1]));
			list.add(map);
		}

		var c = list.stream().sorted((a, b) -> {
			String ak = a.keySet().iterator().next();
			String bk = b.keySet().iterator().next();
			Integer av = a.get(ak);
			Integer bv = b.get(bk);
			int re = bv.compareTo(av);
			int re2 = ak.compareTo(bk);
			if (re == 0) {
				return re2;
			} else {
				return re;
			}
		}).collect(Collectors.toList());
		
		c.forEach(i -> {
			System.out.println(i.keySet().iterator().next() + " " + i.values().iterator().next());
		});

	}
}