LeetCode : Rotate Array

主要是C++ 11中Vector的一些用法.

void rotate(vector<int>& nums, int k)
{
    int len = nums.size();
    k = k % len; //取余
    if(k == 0)
        return;

    vector<int> rec(nums.end() - k, nums.end());
    nums.insert(nums.begin(), rec.begin(), rec.end());
    nums.erase(nums.begin() + len, nums.end());
}

vector.insert

Type	Method
single element	iterator insert (const_iterator position, const value_type& val);
fill	iterator insert (const_iterator position, size_type n, const value_type& val);
range	template iterator insert (const_iterator position, InputIterator first, InputIterator last);
move	iterator insert (const_iterator position, value_type&& val);
initializer list	iterator insert (const_iterator position, initializer_list il);

vector.erase

Type	Method
single element	iterator erase (const_iterator position);
range	iterator erase (const_iterator first, const_iterator last);