/* author : ~swim~ date : 23-may-2018 description : [ASSIGNMENT] : Form The Largest TASK : Given a number, Return The Maximum number could be formed from the digits of the number given. NOTE : - Only Positve numbers passed to the method, numbers Contain digits [1:9] inclusive! - Digit Duplications could occur, So also consider it when forming the Largest. For Example :: 1. maxNumber(213) --> return (321) Explanation : As 321 is The Maximum number could be formed from the digits of the number 213. 2. maxNumber(7389) --> return (9873) Explanation : As 9873 is The Maximum number could be formed from the digits of the number 7389. 3. maxNumber(63729) --> return (97632) Explanation : As 97632 is The Maximum number could be formed from the digits of the number 63729. HappyCodings!:-) https://code.sololearn.com/WB2MAg0h7qW4/?ref=app Input: enter a number and press submit */ #include #include #include #include #include using namespace std; string findMax(string_view num) { multiset> nset{num.begin(),num.end()}; stringstream oss; for(auto e:nset) oss << e; return oss.str(); } int main() { string nstr{"437929"}; cin >> nstr; if(*nstr.begin()=='-') { cerr << "error, enter positive numbers only"; exit(1); } string valid{"123456789"}; if(string::npos != nstr.find_first_not_of(valid)) { cerr << "error, the number should contain digits between [1,9] only"; exit(2); } cout << "input : " << nstr << "\n\n"; cout << "output:\n"; cout << findMax(nstr); return 0; }

[Assignment] Largest Number.cpp