Java clean solution by sorting || Best Approach
\tclass Solution {\n\t\tpublic int minMovesToSeat(int[] seats, int[] students) {\n\t\t\tArrays.sort(seats);\n\t\t\tArrays.sort(students);\n\t\t\tint count = 0;\
\tclass Solution {\n\t\tpublic int minMovesToSeat(int[] seats, int[] students) {\n\t\t\tArrays.sort(seats);\n\t\t\tArrays.sort(students);\n\t\t\tint count = 0;\n\t\t\tfor (int i = 0; i < seats.length; ++i) {\n\t\t\t\tcount += Math.abs(seats[i] - students[i]);\n\t\t\t}\n\t\t\treturn count;\n\n\t\t}\n\t}
['Sorting', 'Java']