• Skip to primary navigation
  • Skip to content
  • Skip to footer
zhicheng xie's demo blog
  • Quick-Start Guide

    Your Name

    I am an amazing person.

    • Somewhere

    Minimum Number of Moves to Seat Everyone

    less than 1 minute read

    <-E 2037> Minimum Number of Moves to Seat Everyone

    class Solution {
    public:
        int minMovesToSeat(vector<int>& seats, vector<int>& students) {
            sort(seats.begin(),seats.end());
            sort(students.begin(),students.end());
            int ans = 0;
            for(int i = 0; i < seats.size(); i++) {
                ans = ans + abs(seats[i] - students[i]);
            }
            return ans;
        }
    };
    

    Tags: Algorithms, C++, Leetcode

    Updated: April 16, 2022

    Share on

    Twitter Facebook LinkedIn
    Previous Next

    You may also enjoy

    Decode Ways

    less than 1 minute read

    <-M 91> Decode Ways

    Word Break

    less than 1 minute read

    <-H 139> Word Break

    Distinct Subsequences

    less than 1 minute read

    <-H 115> Distinct Subsequences

    Edit Distance

    less than 1 minute read

    <-H 72> Edit Distance

    • Follow:
    • Feed
    © 2023 zhicheng xie's blog. Powered by Jekyll & Minimal Mistakes.