Minimum Number of Moves to Seat Everyone

첫번째 코드

 

순서대로 정렬한 후에 숫자를 비교하면 되지 않을까?

라는 간단한 아이디어에서 시작하였다!

 

class Solution:
    def minMovesToSeat(self, seats: List[int], students: List[int]) -> int:
        seats.sort()
        students.sort()
        answer = 0

        for i, j in zip(seats, students):
            answer += abs(i - j)
        
        return answer

 

통과

---

링크

https://github.com/ornni/leetcode/tree/main/2037-minimum-number-of-moves-to-seat-everyone

leetcode/2037-minimum-number-of-moves-to-seat-everyone at main · ornni/leetcode