使用c++做回溯题时,常要用到切片操作,这一操作在python中很容易实现,但是在C++中稍微有点不同,所以记录一下。
当要删除vector& conditional中第i个数时,python操作为
conditional[:i] + conditional[i+1:]
C++操作为:先定义一个指向conditional中第i个数的迭代器,然后使用erase函数删除
vector<int>::iterator iter = conditional.begin() + i;
conditional.erase(iter);
当要删除vector& conditional中前i个数时,python操作为
conditional[i+1:]
C++操作为:先定义一个指向conditional迭代器,然后使用erase函数删除
vector<int>::iterator iter = conditional.begin();
conditional.erase(iter, iter + i); // erase两个参数均为迭代器
erase函数的原型如下:
(1)string& erase ( size_t pos = 0, size_t n = npos );
(2)iterator erase ( iterator position );
(3)iterator erase ( iterator first, iterator last );
也就是说有三种用法:
(1)erase(pos,n); 删除从pos开始的n个字符,比如erase(0,1)就是删除第一个字符
(2)erase(position);删除position处的一个字符(position是个string类型的迭代器)
(3)erase(first,last);删除从first到last之间的字符(first和last都是迭代器)
#include <iostream>
#include <vector>
#include <cmath>
using namespace std;
vector<vector<int> > res;
int num = 0;
void backtrack( vector<int>& state, vector<int>& conditional){
if( conditional.size() == 1 ){
if( abs( state.back()-conditional[0] )!= 1 ) {
state.push_back(conditional[0]);
res.push_back(state);
state.pop_back();
}
return;
}
for( int i = 0; i < conditional.size(); i++ ){
// cout << "--" << endl;
if( state.size() > 0 && abs( state.back() -conditional[i] ) == 1)
continue;
state.push_back(conditional[i]);
// split,使用迭代器进行切片
int val = conditional[i];
// 迭代器指向第i个数
vector<int>::iterator iter = conditional.begin() + i;
// 删除第i个数,相当于把他前后切片
conditional.erase(iter);
backtrack(state, conditional);
state.pop_back();
// 恢复原数组
conditional.insert(iter, val);
}
return;
}
int main(int argc, char** argv){
cin >> num;
// cout << num << endl;
if( num == 1 )
cout << 1 << endl;
else
{
vector<int> state;
vector<int> nums(num);
for(int i = 0; i < num; i++){
nums[i] = i+1;
// cout << nums[i] << endl;
}
backtrack(state, nums);
if( res.size() != 0 )
// cout << res.size() << endl;
for(int i = 0; i < res.size(); i++ ){
for( int j = 0; j < res[i].size(); j++ ){
cout << res[i][j] << " ";
}
cout << endl;
}
}
return 0;
}