一、题目描述
输入一个正整数数组,把数组里所有数字拼接起来排成一个数,打印能拼接出的所有数字中最小的一个。例如输入数组{3,32,321},则打印出这三个数字能排成的最小数字为321323。
二、思路分析
1、暴力解法,先使用回溯法获取所有全排列,然后从所有全排列中获取最小值。{3,32,321}的全排列数组如下。
C++:
#include<iostream>
#include<vector>
#include<algorithm>
#include<string>
using namespace std;
string numJoint(vector<int>& nums) {
//将数组中的数字进行拼接
string num;
for (int i = 0; i < nums.size(); i++) {
num += to_string(nums[i]);
}
//cout << num << endl;
return num;
}
void findMinNum(vector<string>& nums) {
//遍历数组,找到最小值
string ans;
int minNum = stoi(nums[0]);//C++11 ,stoi()函数将int转为string,to_string()将int转为string
for (int i = 1; i < nums.size();i++) {
if (stoi(nums[i]) < minNum) {
minNum = stoi(nums[i]);
}
}
ans = to_string(minNum);
cout << "ans=" << ans << endl;
}
void printAllNums(vector<vector<int>>& allNums) {
//打印数组allNums中的元素
vector<string> nums;
string num;
int len = allNums.size();
for (int i = 0; i < len; i++) {
//printElement(allNums[i]);
num = numJoint(allNums[i]);
cout << num << endl;
nums.push_back(num);
}
findMinNum(nums);
}
static bool cmp(int a, int b) {
//制定数组排序规则
string ab = to_string(a) + to_string(b);
string ba = to_string(b) + to_string(a);
return ab < ba;
}
vector<vector<int>> permutationAll(vector<vector<int>> &allNums,vector<int>& numbers, int begin) {
//获取全排列-回溯
int length = numbers.size();
if (begin == length) {
allNums.push_back(numbers);//路径
return allNums;
}
for (int i = begin; i < length; i++) {
//如果字符串相同,则不交换
if (i != begin && numbers[i] == numbers[begin]) {
continue;
}
swap(numbers[begin], numbers[i]);//位置交换
permutationAll(allNums,numbers, begin + 1);//递归调用
}
return allNums;
}
int main() {
int array[] = {3,32,321};
vector<int> nums = {array,array+3};
vector<vector<int>> allNums;
permutationAll(allNums,nums, 0);
printAllNums(allNums);
return 0;
}
2、约定一种排序规则。以数组{3,32,321}为例,全排列的所有结果共有6种,其中{321,32,2}可以排成最小的数字321323
C++:
#include<iostream>
#include<vector>
#include<algorithm>
#include<string>
using namespace std;
void printElement(vector<int>& nums) {
//打印数组nums中的元素
int len = nums.size();
for (int i = 0; i < len; i++) {
cout << nums[i] << " ";
}
cout << endl;
}
static bool cmp(int a, int b) {
//制定数组排序规则
string ab = to_string(a) + to_string(b);
string ba = to_string(b) + to_string(a);
return ab < ba;
}
void numJoint(vector<int>& nums) {
//将数组中的数字进行拼接
string num;
for (int i = 0; i < nums.size(); i++) {
num += to_string(nums[i]);
}
//return num;
cout << num;
}
int main() {
int array[] = {3,32,321};
vector<int> nums = {array,array+3};
sort(nums.begin(),nums.end());
printElement(nums);
sort(nums.begin(), nums.end(),cmp);
printElement(nums);
numJoint(nums);
return 0;
}
python实现:
# -*- coding:utf-8 -*-
class Solution:
def PrintMinNumber(self, numbers):
cmpare = lambda a,b:cmp(str(a)+ str(b),str(b)+str(a))
min_string = sorted(numbers,cmp = cmpare)
return ''.join(str(ele) for ele in min_string)#将序列中的元素以指定的字符连接
cmp函数是python2中一个用于比较两个列表、数字或字符串等的大小关系的函数,在python3中已经无法使用这个函数了,而是使用operator模块实现同样的功能。cmp函数介绍