經(jīng)典題目,給N個數(shù),重新順序,首尾相接,讓組成的新數(shù)最小. 按相連的大小順序排序.注意輸出0的情況
#include <bits/stdc++.h>using namespace std;bool cmp(string a, string b){ return a + b < b + a;}int main(){ int N; cin >> N; vector<string> a; for (int i = 0; i < N; i++) { string x; cin >> x; a.push_back(x); } sort(a.begin(), a.end(), cmp); string ans; for (auto e : a) ans += e; int i = 0; while (ans[i] == '0' && i < ans.size()) i++; if (i == ans.size()) cout << '0'; else for (;i < ans.size(); i++) cout << ans[i]; cout << endl;}新聞熱點
疑難解答
