Leet Code Daily 2024-07-08 - Find the Winner of the Circular Game

class Solution {
public:
    int findTheWinner(int n, int k) {

        vector<int> friends;
        for (int i = 1; i <= n; i++) {
            friends.push_back(i);
        }

        for (int i = 0; friends.size() > 1;) {
            i = (i + k - 1) % friends.size();
            friends.erase(friends.begin() + i);
        }

        return friends.front();
    }
};