C++ 算法 rotate_copy() 函数用于对 [first, last) 范围内的元素进行旋转复制。
- 序列将从源序列中间的元素开始,最后一个元素将在第一个元素之后。
- 它将第一个和中间的元素附加到中间和最后一个元素之间的元素。
用法
template <class ForwardIterator, class OutputIterator>
OutputIterator rotate_copy (ForwardIterator first, ForwardIterator middle,
ForwardIterator last, OutputIterator result);
参数
first:一个前向迭代器,指向要旋转的范围内第一个元素的位置。
middle: 向前迭代器寻址范围 [first, last) 中移动到范围中第一个位置的元素。
last:一个向前迭代器,指向元素被反转的范围内最后一个元素的位置。
result:一个输出迭代器,指向目标范围中第一个元素的位置。
返回值
rotate_copy() 函数返回一个输出迭代器寻址到复制范围的末尾。
复杂度
复杂度在 [first, last):为每个元素执行赋值。
数据竞争
访问范围 [first, last) 中的对象。
结果和返回值之间范围内的对象发生了变化。
异常
如果元素赋值或迭代器上的操作引发异常,则此函数将引发异常。
注意:无效的参数会导致未定义的行为。
例子1
让我们看看旋转给定字符串的简单示例:
#include <algorithm>
#include <iostream>
#include <string>
#include <iterator>
using namespace std;
int main() {
string str = " N I K I T A";
string result;
cout << "Before Rotate:"<< str << endl;
rotate_copy(str.begin(), str.begin() + 2, str.end(),
back_inserter(result));
cout <<"After Rotate :" << result << endl;
return 0;
}
输出:
Before Rotate: N I K I T A After Rotate : I K I T A N
例子2
让我们看另一个简单的例子:
#include <algorithm>
#include <vector>
#include <iostream>
using namespace std;
int main()
{
vector<int> src = {1, 2, 3, 4, 5};
auto pivot = find(src.begin(), src.end(), 3);
vector<int> dest(src.size());
rotate_copy(src.begin(), pivot, src.end(), dest.begin());
for (const auto &i:dest) {
cout << i << ' ';
}
cout << '\n';
return 0;
}
输出:
3 4 5 1 2
例子3
让我们看另一个简单的例子:
#include <iostream>
#include <algorithm>
#include <vector>
#include <iomanip>
using namespace std;
void print(char a[], int N)
{
for(int i = 0; i < N; i++)
{
cout << (i + 1) << ". " << setw(1)
<< left << a[i] << " ";
}
cout << endl;
}
int main()
{
char s[] = {'A', 'B', 'C', 'D', 'E', 'F', 'G', 'H'};
int slen = sizeof(s) / sizeof(char), tlen = slen;
char t[tlen];
cout << "Character array s[]:";
print(s, slen);
cout << "Rotate s[] with \'C\' as middle element and copy in t[]" << endl;
rotate_copy(s, s + 2, s + slen, t);
cout << "Character array t[]:";
print(t, tlen);
cout << "Rotate t[] with \'A\' as middle element and copy in s[]" << endl;
rotate_copy(t, t + 6, t + tlen, s);
cout << "Character array s[]:";
print(s, slen);
cout << "Character array t[]:";
print(t, tlen);
return 0;
}
输出:
Character array s[]:1. A 2. B 3. C 4. D 5. E 6. F 7. G 8. H Rotate s[] with 'C' as middle element and copy in t[] Character array t[]:1. C 2. D 3. E 4. F 5. G 6. H 7. A 8. B Rotate t[] with 'A' as middle element and copy in s[] Character array s[]:1. A 2. B 3. C 4. D 5. E 6. F 7. G 8. H Character array t[]:1. C 2. D 3. E 4. F 5. G 6. H 7. A 8. B
示例 4
让我们看另一个简单的例子:
#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <functional>
using namespace std ;
int main()
{
const int VECTOR_SIZE = 8 ;
// Define a template class vector of strings
typedef vector<string> StrVector ;
//Define an iterator for template class vector of strings
typedef StrVector::iterator StrVectorIt ;
StrVector Tongue_Twister(VECTOR_SIZE) ;
StrVector Rotated_Twister(VECTOR_SIZE) ;
StrVectorIt start, middle, end, it, RTstart, RTend ;
start = Tongue_Twister.begin() ; // location of first
// element of Tongue_Twister
end = Tongue_Twister.end() ; // one past the location last
// element of Tongue_Twister
middle = start + 3 ; // start position for
// rotating elements
RTstart = Rotated_Twister.begin() ; // location of first
// element of Rotated_Twister
RTend = Rotated_Twister.end() ; // one past the location last
// element of Rotated_Twister
//Initialize vector Tongue_Twister
Tongue_Twister[0] = "she" ;
Tongue_Twister[1] = "sells" ;
Tongue_Twister[2] = "sea" ;
Tongue_Twister[3] = "shells" ;
Tongue_Twister[4] = "by";
Tongue_Twister[5] = "the";
Tongue_Twister[6] = "sea" ;
Tongue_Twister[7] = "shore" ;
cout << "Before calling rotate_copy:\n" << endl ;
// print content of Tongue_Twister
cout << "Try this Tongue Twister:" ;
for(it = start; it != end; it++)
cout << *it << " " ;
cout << "\n\n" ;
// rotate the items in the vector Tongue_Twist to the right by
// 3 positions and copy the results to Rotated_Twister
rotate_copy(start, middle, end, RTstart) ;
cout << "After calling rotate_copy:\n" << endl ;
// print content of Tongue_Twister
cout << "Tongue_Twister:" ;
for(it = start; it != end; it++)
cout << *it << " " ;
cout << "\n\n" ;
// print content of Rotated_Twister
cout << "Now try the rotated Tongue Twister:" ;
for(it = RTstart; it != RTend; it++)
cout << *it << " " ;
cout << "\n\n" ;
return 0;
}
输出:
Before calling rotate_copy: Try this Tongue Twister:she sells sea shells by the sea shore After calling rotate_copy: Tongue_Twister:she sells sea shells by the sea shore Now try the rotated Tongue Twister:shells by the sea shore she sells sea
相关用法
- C++ Algorithm rotate()用法及代码示例
- C++ Algorithm remove_if()用法及代码示例
- C++ Algorithm remove()用法及代码示例
- C++ Algorithm remove_copy_if()用法及代码示例
- C++ Algorithm random_shuffle()用法及代码示例
- C++ Algorithm replace()用法及代码示例
- C++ Algorithm reverse_copy()用法及代码示例
- C++ Algorithm replace_copy()用法及代码示例
- C++ Algorithm replace_copy_if()用法及代码示例
- C++ Algorithm remove_copy()用法及代码示例
- C++ Algorithm reverse()用法及代码示例
- C++ Algorithm replace_if()用法及代码示例
- C++ Algorithm max_element()用法及代码示例
- C++ Algorithm set_union()用法及代码示例
- C++ Algorithm next_permutation()用法及代码示例
- C++ Algorithm upper_bound()用法及代码示例
- C++ Algorithm minmax()用法及代码示例
- C++ Algorithm pop_heap()用法及代码示例
- C++ Algorithm set_intersection()用法及代码示例
- C++ Algorithm lower_bound()用法及代码示例
注:本文由纯净天空筛选整理自 C++ Algorithm rotate_copy()。非经特殊声明,原始代码版权归原作者所有,本译文未经允许或授权,请勿转载或复制。