View difference between Paste ID: nMhEL4wW and SF09E7Rf

 // Author : Saurav Kalsoor
-// Sort By Reversing Digits - JAVA
+// Sort By Reversing Digits - KOTLIN
 
-import java.util.*;
+import java.util.*
 
-public class Test {
+var sc: Scanner = Scanner(System.`in`)
-
+
-    static Scanner sc = new Scanner(System.in);
+fun main() {
-    public static void main(String[] args) {
+    val n: Int = sc.nextInt()
-        int n = sc.nextInt();
+    val arr: ArrayList<Int> = ArrayList<Int>()
-        ArrayList<Integer> arr = new ArrayList<>();
+    for (i in 0 until n) {
         val input: Int = sc.nextInt()
-        for(int i=0; i < n; i++) {
+        arr.add(input)
-            int input = sc.nextInt();
+
-            arr.add(input);
+    val result: ArrayList<Int> = sortByDigits(arr)
     for (i in 0 until n) print(result.get(i).toString() + " ")
     println()
-        ArrayList<Integer> result = sortByDigits(arr);
+
-
+
-        for(int i=0; i < n; i++)
+fun sortByDigits(arr: ArrayList<Int>): java.util.ArrayList<Int> {
-            System.out.print(result.get(i) + " ");
+    Collections.sort(arr, SortByReversingDigits())
-
+    return arr
-        System.out.println();
+
 
 internal class SortByReversingDigits : Comparator<Int> {
-    public static ArrayList<Integer> sortByDigits(ArrayList<Integer> arr){
+    override fun compare(a: Int, b: Int): Int {
-        Collections.sort(arr, new SortByReversingDigits());
+        val revA = reverseDigits(a)
-        return arr;
+        val revB = reverseDigits(b)
         return if (revA == revB) {
             a - b
         } else {
-class SortByReversingDigits implements Comparator<Integer> {
+            revA - revB
-
+
-    public int compare(Integer a, Integer b){
+
 
-        int revA = reverseDigits(a), revB = reverseDigits(b);
+    fun reverseDigits(num: Int): Int {
-        if(revA == revB){
+        var n = num
-            return a - b;
+        var rev = 0
         while (n > 0) {
-        else{
+            rev = rev * 10
-            return revA - revB;
+            rev = rev + n % 10
             n = n / 10
         }
         return rev
-    public int reverseDigits(int n){
+
-        int rev = 0;
+}