[Leetcode] Permutations

Source: Internet
Author: User

Given a collection of numbers, return all possible permutations.

For example,[1,2,3]Have the following permutations:[1,2,3],[1,3,2],[2,1,3],[2,3,1],[3,1,2], And[3,2,1].

Class solution {public: vector <int> permute (vector <int> & num) {vector <int> Te; vector <int> res, temp; // store the Intermediate Value int Len = num in temp. size (); If (LEN <= 0) return res; For (INT I = 0; I <Len; I ++) {Te. push_back (Num [I]); temp. push_back (TE); Te. clear ();} // end for while (! Temp. empty () {Te = temp. back (); temp. pop_back (); If (Te. size () = Len) {res. push_back (TE); continue;} For (INT I = 0; I <Len; I ++) {If (find (Te. begin (), te. end (), num [I]) = tE. end () {Te. push_back (Num [I]); temp. push_back (TE); Te. pop_back () ;}}// end while return res ;}};

It is still the previous stack idea, but it is also good to use vector.

Contact Us

The content source of this page is from Internet, which doesn't represent Alibaba Cloud's opinion; products and services mentioned on that page don't have any relationship with Alibaba Cloud. If the content of the page makes you feel confusing, please write us an email, we will handle the problem within 5 days after receiving your email.

If you find any instances of plagiarism from the community, please send an email to: info-contact@alibabacloud.com and provide relevant evidence. A staff member will contact you within 5 working days.

A Free Trial That Lets You Build Big!

Start building with 50+ products and up to 12 months usage for Elastic Compute Service

  • Sales Support

    1 on 1 presale consultation

  • After-Sales Support

    24/7 Technical Support 6 Free Tickets per Quarter Faster Response

  • Alibaba Cloud offers highly flexible support services tailored to meet your exact needs.