<p>Given a list of non-negative integers <code>nums</code>, arrange them such that they form the largest number and return it.</p>

<p>Since the result may be very large, so you need to return a string instead of an integer.</p>

<p>&nbsp;</p>
<p><strong class="example">Example 1:</strong></p>

<pre>
<strong>Input:</strong> nums = [10,2]
<strong>Output:</strong> &quot;210&quot;
</pre>

<p><strong class="example">Example 2:</strong></p>

<pre>
<strong>Input:</strong> nums = [3,30,34,5,9]
<strong>Output:</strong> &quot;9534330&quot;
</pre>

<p>&nbsp;</p>
<p><strong>Constraints:</strong></p>

<ul>
	<li><code>1 &lt;= nums.length &lt;= 100</code></li>
	<li><code>0 &lt;= nums[i] &lt;= 10<sup>9</sup></code></li>
</ul>

class Solution {
public:
    static std::string largestNumber(std::vector<int> &nums) {

        std::vector<std::string> stringNums;
        stringNums.reserve(nums.size());
        std::transform(nums.begin(), nums.end(), std::back_inserter(stringNums),
                       [](int num) {
                           return std::to_string(num);
                       }
        );

        std::sort(stringNums.begin(), stringNums.end(), [](const std::string &s1, const std::string &s2) {
            return s1 + s2 > s2 + s1;
        });

        if (stringNums[0] == "0") {
            return "0";
        }

        std::string result;
        result.reserve(
                std::accumulate(stringNums.begin(), stringNums.end(), 0,
                                [](size_t acc, const std::string &num) {
                                    return acc + num.length();
                                }
                )
        );
        return std::accumulate(stringNums.begin(), stringNums.end(), std::move(result),
                               [](const std::string &acc, const std::string &num) {
                                   return acc + num;
                               }
        );
    }
};

17900