Swapping Digits

最新推荐文章于 2020-10-08 20:54:30 发布

BoBoAn_DouYa

最新推荐文章于 2020-10-08 20:54:30 发布

阅读量990

点赞数

分类专栏： C++ 文章标签： swap

本文链接：https://blog.csdn.net/chengy35/article/details/11126781

版权

C++ 专栏收录该内容

80 篇文章 0 订阅

订阅专栏

Description

Let S be a string containing the digits of a (possibly large) positive integer. For example, S="1147" represents the integer 1147. S will not have any leading zeros.

You are allowed to swap one pair of digits in the given number. In other words, you may choose a pair of distinct indices i and j, and swap the characters S[i] and S[j]. Note that you may also leave the original number unchanged. The new string must again describe a valid positive integer, i.e., it must not have any leading zeros.

Your task is to find out the string that represents the smallest possible integer that can be obtained.

Input

The input begins with a line containing an integer T (T<=150), which indicates the number of test cases. Each case contains a string S. S contains only digits (‘0’-‘9’), and its length is between 2 and 50, inclusive.

Output

For each case, output the smallest possible integer in a line.

Sample Input

Copy sample input to clipboard