int main()
{
get_time("begin");
int a[]={
1,1,1,2
};
//for(int i=1;i<=3;++i)a[i-1]=i;
vector<int> nums(a,a+sizeof(a)/4);
vector<int> vec = nums;
vector<vector<int>> res,res2;
perm(nums,0,nums.size()-1,res);
Solution s;
res2=s.permute(vec);
for(int i=0;i<res.size();++i){
copy(res[i].begin(), res[i].end(), OstreamItr(cout, " "));
cout<<endl;
}
res = res2;
cout<<"not recursive:"<<endl;
for(int i=0;i<res.size();++i){
copy(res[i].begin(), res[i].end(), OstreamItr(cout, " "));
cout<<endl;
}
get_time("end");
return 0;
}
int main(){
Solution s;
vector<int> a;
a.push_back(1);
s.permute(a);
return 0;
}
int main(int argc, char const *argv[]) {
Solution sol;
vector<int> v = {0,-1,1};
vector<vector<int>> vv;
vv = sol.permute(v);
printvv(vv);
return 0;
}
int main(int argc, const char * argv[]) {
// insert code here...
Solution so;
vector<int> nums({1,2,2});
vector<vector<int>> r = so.permute(nums);
so.dump();
return 0;
}
int main() {
Solution *sol = new Solution();
std::vector<int> num;
num.push_back(1);
num.push_back(2);
num.push_back(3);
sol->permute(num);
}
int main()
{
Solution s;
vector<int> nums = { 1, 2, 3};
s.permute(nums);
return 0;
}
int main()
{
int data[]{ 1,2,3 };
vector<int> nums(data, data + sizeof(data) / sizeof(int));
Solution test;
test.permute(nums);
return 0;
}
int main(int argc, char **argv)
{
Solution solution;
vector<int> num = {1,2,3, 4, 5};
vector<vector<int>> ans = solution.permute(num);
for (auto i : ans)
print(i);
return 0;
}
int main()
{
Solution s;
vector<int> v;
v.push_back(1);
v.push_back(2);
v.push_back(3);
s.permute(v);
cin.get();
}
void sample() {
vector<int> nums({1,2,3});
Solution solution;
vector<vector<int>> results = solution.permute(nums);
for (auto result : results) {
for (auto num : result) {
cout << num << " ";
}
cout << endl;
}
}
int main(){
Solution s;
vector<int> vi{1,2,3,4};
auto vvi = s.permute(vi);
for(auto vi :vvi){
for(int i: vi){
cout << i;
}
cout << endl;
}
}
int main(void)
{
Solution s;
int arr[] = {1,2,3};
vector<int> numbers;
for(int i=0; i<sizeof(arr)/sizeof(int);i++)
numbers.push_back(arr[i]);
vector<vector<int> > result = s.permute(numbers);
getchar();
return 0;
}
int main()
{
Solution s;
{
vector<int> num;
num.push_back(1);
num.push_back(2);
num.push_back(3);
print(s.permute(num));
}
{
vector<int> num;
num.push_back(1);
num.push_back(2);
num.push_back(2);
print(s.permute(num));
}
return 0;
}
int main(int argc, char *argv[]){
Solution s;
auto matrix = s.permute(vector<int>{1, 2, 3});
for (auto line : matrix){
for (auto v : line){
cout << v << ", ";
}
cout << endl;
}
system("pause");
return 0;
}
int main(int argc, char *argv[])
{
vector<int> num;
num.push_back(1);
num.push_back(2);
num.push_back(3);
vector<vector<int> > result;
Solution so;
result = so.permute(num);
so.printCheck(result);
return 0;
}
int main() {
int data[] = {1, 2, 3};
vector<int> nums(data, data+3);
Solution s;
vector<vector<int> > result = s.permute(nums);
for(int i=0; i<result.size(); ++i) {
for(int k=0; k<result[i].size(); ++k) {
cout << result[i][k] << "\t";
}
cout << endl;
}
}
int main() {
int input[] = {1,2,3};
vector<int> num(input, input + sizeof(input) / sizeof(int));
Solution sol;
vector<vector<int> > solVec = sol.permute(num);
for (int i = 0; i < solVec.size(); ++i) {
cout << "[ ";
for (int j = 0; j < solVec[i].size(); ++j)
cout << solVec[i][j] << " ";
cout << "]" << endl;
}
}
int main()
{
Solution s;
vector<int> vec={1,2,3,4};
vector<vector<int> > result=s.permute(vec);
for(auto a:result)
{
for(auto v:a)
cout<<v<<" ";
cout<<endl;
}
}
int main(){
vector<int> vi(4);
vi[0] = 2, vi[1] = 1, vi[2] = 1, vi[3] = 2;
Solution st;
vector<vector<int> > vvi = st.permute(vi);
for(int i = 0; i < vvi.size(); ++i){
for(int j = 0; j < vvi[i].size(); ++j)
cout<<vvi[i][j]<<' ';
cout<<endl;
}
return 0;
}
int main() {
int A[] = {1, 2, 3};
vector<int> num(A, A + sizeof(A)/sizeof(int));
Solution solu = Solution();
vector<vector<int> > res = solu.permute(num);
for (size_t i = 0; i < res.size(); i++) {
for (size_t j = 0; j < res[i].size(); j++) {
cout << res[i][j] << ", ";
}
cout << endl;
}
}
int main(int argc, char* argv[]){
Solution sol;
//vector<int> num {6,8,7,4,3,2};
//reverse(num.begin(),num.end());
//printvector(num);
vector<int> num {1,1};
//printvector(num);
vector<vector<int>> res = sol.permute(num);
printmatrix(res);
//sol.next_permutation(num);
return 0;
}
int main() {
Solution s;
vector<int> nums{1,2,3};
for (auto &line : s.permute(nums)) {
for (auto n : line) {
cout << n << " ";
}
cout << endl;
}
return 0;
}
int main() {
vector<int> nums = {3, 1, 3};
Solution sln = Solution(nums);
sln.permute(0);
vector<vector<int>> result = sln.getResult();
for (int i = 0; i < result.size(); i++) {
for (int j = 0; j < result[0].size(); j++) {
cout << result[i][j] << " ";
}
cout << endl;
}
}
int main()
{
Solution sol;
vector<int> a = { 1, 1,2 };
vector<vector<int>> s;
s = sol.permute(a);
for (int i = 0; i < s.size(); i++){
for (int j = 0; j < s[i].size()-1; j++)
printf("%d ", s[i][j]);
printf("%d\n", s[i][s[i].size() - 1]);
}
system("pause");
}
int main(int argc, char const *argv[])
{
Solution sol;
int A[] = {1, 2, 3};
int n = sizeof(A) / sizeof(int);
vector<int> num(A, A + n);
auto result = sol.permute(num);
for (auto row : result) {
copy(row.begin(), row.end(), ostream_iterator<int>(cout, " "));
cout << '\n';
}
return 0;
}
int main() {
vector<int> nums;
nums.push_back(1); nums.push_back(2); nums.push_back(3); nums.push_back(4); nums.push_back(5);
Solution sl;
vector<vector<int> > res = sl.permute(nums);
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;
}
int main() {
Solution sol;
vector<int> nums {1, 2, 3};
vector<vector<int>> res = sol.permute(nums);
for (const vector<int>& v : res) {
for (int val : v) {
printf("%d ", val);
}
printf("\n");
}
}
int main() {
int elems[] = {1, 1, 1};
vector<vector<int> > res;
vector<int> elements(elems, elems + sizeof(elems) / sizeof(int));
Solution s;
res = s.permute(elements);
print(res);
system("pause");
return 0;
}
int main(int argc, const char * argv[]) {
Solution solution;
// Problem A
cout << "Problem A" << endl;
cout << solution.isAnagram("anagram", "nagaram") << endl;
// Problem B
cout << "Problem B" << endl;
int numbers[] = { 3, 30, 34, 5, 9 };
vector<int> numberVector(numbers, numbers + 5);
cout << solution.largestNumber(numberVector) << endl;
// Problem C
cout << "Problem C" << endl;
vector<vector<int>> matrix = {
{ 1, 3, 5, 7 },
{ 10, 11, 16, 20},
{ 23, 30, 34, 50}
};
cout << solution.searchMatrix(matrix, -1) << endl;
cout << solution.searchMatrix(matrix, 23) << endl;
cout << solution.searchMatrix(matrix, 20) << endl;
cout << solution.searchMatrix(matrix, 60) << endl;
// Problem D
cout << "Problem D" << endl;
vector<int> collection = { 1, 1, 1, 3, 2 };
vector<vector<int>> result = solution.permute(collection);
for (int i = 0; i < result.size(); i++) {
for (int j = 0; j < result[i].size(); j++) {
cout << result[i][j] << " ";
}
cout << endl;
}
// Problem E
cout << "Problem E" << endl;
vector<Interval> intervals = { Interval(1, 3), Interval(2, 6), Interval(8, 10), Interval(15, 18) };
vector<Interval> merged = solution.merge(intervals);
for (int i = 0; i < merged.size(); i++) {
cout << "[" << merged[i].start << ", " << merged[i].end << "], ";
}
return 0;
}
int main()
{
Solution s;
vector<vector<int> > vv;
#if 1
int a[] = {1,1,2,3};
s.permute(a, 0, 4, vv);
printVV(vv);
#endif
#if 0
vector<string> results = s.restoreIpAddress("1111111");
printVS(results);
#endif
return 0;
}
