class Solution {
public:
void rotate(vector<int>& nums, int k) {
int n = nums.size();
k %= n;
reverse(nums.begin(), nums.end());
reverse(nums.begin(), nums.begin() + k);
reverse(nums.begin() + k, nums.end());
}
};
'알고리즘 > leetcode' 카테고리의 다른 글
14. Longest Common Prefix (0) | 2022.07.30 |
---|---|
202. Happy Number (0) | 2022.07.27 |
19. Remove Nth Node From End of List (0) | 2022.07.24 |
190. Reverse Bits (0) | 2022.07.24 |
191. Number of 1 Bits (0) | 2022.07.24 |