C++ (Cpp) Solution::getPermutation Examples

Example #1

File: PermutationSequence.cpp Project: PeoceWang/leetcode

int main() {
    Solution sol;
    for (int i = 1; i <= 6; i++)
        cout << sol.getPermutation(3, i) << endl;
    cout << sol.getPermutation(3, 6) << endl;
    return 0;
}

Example #2

File: 60.cpp Project: chaitanchun/person

int main()
{
    Solution s;
    cout << s.getPermutation(3, 5) << endl;
    cout << s.getPermutation(3, 1) << endl;
    cout << s.getPermutation(3, 6) << endl;
    cout << s.getPermutation(3, 3) << endl;
    return 0;
}

Example #3

File: permutation-sequence.cpp Project: HustLion/algorithm

int main() {
  Solution sol;

  for (int i = 1; i <= 25; ++i) {
    cout << sol.getPermutation(4, i) << endl;
  }

  cout << sol.getPermutation(8, 30654) << endl;
  
  return 0;
}

Example #4

File: Permutation_Sequence.cpp Project: YanliSai/LeetCode-1

int main() {
    Solution s;   
    for (int k = 1; k<6+1; ++k) {
       cout<<s.getPermutation(3,k)<<endl;
    }
    return 0;
}

Example #5

File: PermutationSequence.cpp Project: minhajksm/code

int main(void) {

    Solution solution;

    cout << solution.getPermutation(1, 1) << endl;
    return 0;
}

Example #6

File: permutation_seq.cpp Project: hokein/leetcode

int main() {
  freopen("test.txt", "r", stdin);

  Solution s;
  cout << s.getPermutation(3, 6) << endl;
  return 0;
} 

Example #7

File: factorial_n.cpp Project: borisnorm/leetcode-1

int main() {
    int n, k;
    Solution s;
    while (cin >> n >> k)
        cout << s.getPermutation(n, k) << endl;
    return 0;
}

Example #8

File: permutation-sequence.cpp Project: tiankonguse/leetcode-solutions

void test(int n, int k){
    Solution work;
    string ans;
    output("n", n);
    output("k", k);
    ans = work.getPermutation(n,  k);
    output("ans", ans);
}

Example #9

int main() {
    Solution sol;
    while (true) {
        int n, k; cin >> n >> k;
        cout << sol.getPermutation(n, k) << endl;
    }
    return 0;
}

Example #10

File: 93_Permutation_Sequence.cpp Project: satanson/leetcode

int main(){
	Solution so;
	string line;
	while(getline(cin,line)){
		vector<int> nk=string2vector<int>(line);
		cout<<so.getPermutation(nk[0],nk[1])<<endl;
	}
}

Example #11

File: permutation_sequence.cpp Project: kaushikacharya/cpp_practise

int main(int argc, char* argv[])
{
    int n = 3;
    int k = 3;
    Solution sln;
    string permutation_at_position_k = sln.getPermutation(n,k);
    cout << "permutation at position k: " << permutation_at_position_k << endl;
    return 0;
}

Example #12

File: permutation.cpp Project: xiongjunliang/leetcode

int main() {
    Solution s;
    int n;
    int k;
    while (cin >> n >> k) {
        cout << s.getPermutation(n, k) << endl;
    }
    return 0;
}

Example #13

File: sm_permutationSequence.cpp Project: lw9210/letcode

int main() {
    Solution s;
    int n = 8;
    int total = s.fac(n);
    cout << "total: " << total << endl;
    for (int i = 1; i <= total; i++) {
        string ret = s.getPermutation(n, i); 
        cout << ret << endl;
    }
}

Example #14

File: le2_1_13.cpp Project: binbinbear/Lec

int main(){
	int n,k;
	string re;
	scanf("%d %d",&n,&k);
	Solution s;
	re=s.getPermutation(n,k);
	cout<<re<<endl;
	return 0;


}

Example #15

File: PermutationSequence.cpp Project: b1ns4oi/LeetCode

int main() 
{
    Solution sol;
    string ret1 = sol.getPermutation(9, 100);
    string ret2 = sol.getPermutation_2(9, 100);
    string ret3 = sol.getPermutation_3(9, 100);

    cout << ret1 << endl;
    cout << ret2 << endl;
    cout << ret3 << endl;
}

Example #16

File: 060.cpp Project: hilings/leetcode

int main(int arg, char *argv[]) {
    // insert code here...
    cout << "LeetCode 060 Permutation Sequence, C++ ...\n\n";

    int n = 3;
    int k = 4;

    Solution sol;
    cout << sol.getPermutation(n, k) << '\n';

    int f = 1;
    for (int i = 1; i <= n; i++) {
        f *= i;
    }
    for (int i = 1; i <= f; i++) {
        cout << i << ' ' << sol.getPermutation(n, i) << '\n';
    }
    
    return 0;
}

Example #17

File: kth_permution.cpp Project: wythern/leetcode

int main(int argc, char** argv){
    if(argc < 3){
        exit(0);
    }
	Solution s;
    int n = atoi(argv[1]);
    int k = atoi(argv[2]);
    string strKthNum = s.getPermutation(n, k);
    cout << "Kth string = " << strKthNum << endl;
	return 0;
}	

Example #18

File: 60.cpp Project: WanchaoYao/leetcode

int main(void)
{
    Solution slt;
    int n, k;
    cin >> n >> k;

    string s = slt.getPermutation(n, k);
    cout << s << endl;
    
    return 0;
}

Example #19

File: 60_PermutationSequence.cpp Project: douxiaozhao/leetcode

int main()
{
    int n, k;
    Solution s;
    while(true)
    {
        cin >> n;
        cin >> k;
        cout << s.getPermutation(n, k) << endl;
    }
    return 0;
}

Example #20

File: PermutationSelectMin.cpp Project: zhangruichang/Algorithm

int main()
{
    Solution S;
    //for(int i=1;i<=100;i++)
    time_t start=clock();
    //for(int i=1;i<=6;i++)
        cout<<S.getPermutation(9, 199269)<<endl;
    time_t end=clock();
    cout<<end-start<<endl;
    //permutation(0,n-1);
    return 0;
}

Example #21

File: Permutation_Sequence.cpp Project: wolaoa/leetcode

int main()
{
    int n,k;
    string ret;
    Solution S;
    while(cin>>n>>k)
    {
       ret = S.getPermutation(n,k);
       if(ret.size()) cout<<ret<<endl;
       else cout<<"NULL"<<endl;
    }
    return 0;
}

Example #22

File: main.cpp Project: juniperdiego/LeeetCode

int main()
{
    int a[] = {5, 6, 7, 8, 4, 3, 2, 1};
    //int a[] = {5, 6, 7, 8};//, 4, 3, 2, 1};
    vector<int> b ;
#if 0
    b.push_back(5);
    b.push_back(6);
    b.push_back(7);
    b.push_back(8);
#else
    b.push_back(4);
    b.push_back(3);
    b.push_back(2);
    b.push_back(1);
    b.push_back(0);
#endif


    Solution sl;
    string  str; 

#if 0
    for(int i = 0 ; i < 100; i++)
    {
        str= sl.getPermutation(5 , i); 
        cout << i << "\t" << str << endl;
    }
#endif
    
    str= sl.getPermutation(8 ,31492); 
    cout <<"1\t"<< 31492 << "\t" << str <<"xx"<< endl;
    str = sl.getPermutation2(8 ,31492); 
    cout <<"2\t"<< 31492 << "\t" << str <<"yy"<< endl;

    return 0;
}

Example #23

File: 60.cpp Project: DerrickChi/LeetCode

int main() {
    int n = 3;
    int factN = 1;
    for (int i = 1; i <= n; i++) {
        factN *= i;
    }

    Solution s;

    for (int k = 1; k <= factN; k++) {
        cout << s.getPermutation(n, k) << endl;
    }

    return 0;
}

Example #24

File: permutation_sequence.cpp Project: ghostincircuit/leetcode

int main()
{
/*
        int a[] = {1,2,3,4,5};
        for (auto i = 0; i < 33; i++) {
                cout << i << ": ";
                for (auto i = 0; i < 4; i++)
                        cout << a[i];
                cout << endl;
                Solution s;
                s.next_perm(a, 4);
        }
        return 0;
*/
        Solution s;
        for (auto i = 1; i < 32; i++) {
                auto r = s.getPermutation(9, i);
                cout << r << endl;
        }
        return 0;
}

Example #25

File: Permutation_Sequence.cpp Project: kennethhu418/LeetCode_Practice

int _tmain(int argc, _TCHAR* argv[])
{
    Solution so;
    string result;

    int n, k;
    cout << "n: ";
    cin >> n;
    cout << "k: ";
    cin >> k;

    while (n >= 0)
    {
        result = so.getPermutation(n, k);
        cout << result.c_str() << endl<<endl;

        cout << "n: ";
        cin >> n;
        cout << "k: ";
        cin >> k;
    }

	return 0;
}

Example #26

File: permutation_sequence2.cpp Project: elden2010/leetcode

int main() {
    Solution s;
    for(int i=1;i<=24;++i)
	cout << s.getPermutation(4,i) << endl;
}

Example #27

File: PermutationSequence2.cpp Project: bilbo3000/coding

int main() {
	Solution sln; 
	cout << sln.getPermutation(9, 219601) << endl; 
}

Example #28

File: Solution.cpp Project: shipengAlan/leetcode

int main(){
    Solution s;
    cout<<s.getPermutation(3,6);

}

Example #29

File: main.m.cpp Project: alsofly/leetcode

int main()
{
   Solution sol;
   cout << sol.getPermutation(4, 10) << endl;
   return 0;
}

Example #30

File: permutationSequences.C Project: ccjeremiahlin/LeetCodePlayGround

int main(){
  Solution s;
  cout<<s.getPermutation(5, 120)<<endl;
  return 0;
}