Given a list of non-negative integers (nums). Find the largest number by arranging them. Constraints: len(nums) > 0
Explain the design concept of the
#include <algorithm>
#include <iostream>
#include <string>
#include <
using namespace std;
// A comparison function which
// is used by sort() in
// printLargest()
int myCompare(string X, string Y)
{
// first append Y at the end of X
string XY = X.append(Y);
// then append X at the end of Y
string YX = Y.append(X);
// Now see which of the two
// formed numbers is greater
return XY.compare(YX) > 0 ? 1 : 0;
}
// The main function that prints
// the arrangement with the
// largest value. The function
// accepts a vector of strings
void printLargest(vector<string> arr)
{
// Sort the numbers using
// library sort function. The
// function uses our comparison
// function myCompare() to compare two strings
sort(arr.begin(), arr.end(), myCompare);
for (int i = 0; i < arr.size(); i++)
cout << arr[i];
}
// Driver code
int main()
{
vector<string> arr;
int size;
string num;
cout<<"Enter the number of elements : ";
cin>> size;
for(int i=0;i<size;i++){
cin>>num;
arr.push_back(num);
}
printLargest(arr);
return 0;
![Given a list of non-negative integers (nums). Find the largest number by arranging them.
Constraints: len(nums) > 0
Example 1:
Input: nums = [1, 23, 456, 789, 101112]
Output: "789456231101112"
Explanation: 789 456 23 1 101112 is the largest number
Example 2:
Input: nums = [1, 2, 3, 4, 5]
Output: "54321"
Explanation: 5 4 3 2 1 is the largest number
Example 3:
Input: nums = [0, 0, 0]
Output: "0"
Explain the design concept for the proposed algorithm.
Pseudocode of your algorithms.
Implement algorithms for the problem.
Analyze the complexity of your algorithms.](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2Fb42a9107-65e6-4614-a858-595dd78b3016%2F6d433636-38a4-447d-b1dd-56abe05643c9%2F03j6go_processed.png&w=3840&q=75)
Step by step
Solved in 2 steps
