首页 / GIT / Swap Digits

Swap Digits

内容导读

互联网集市收集整理的这篇技术教程文章主要介绍了Swap Digits，小编现在分享给大家，供广大互联网技能从业者学习和参考。文章包含1589字，纯文字阅读大概需要3分钟。

内容图文

Description

Now we have a number, you can swap any two adjacent digits of it, but you can not swap more than K times. Then, what is the largest probable number that we can get after your swapping?

Input

There is an integer T (1 <= T <= 200) in the first line, means there are T test cases in total.

For each test case, there is an integer K (0 <= K < 106) in the first line, which has the same meaning as above. And the number is in the next line. It has at most 1000 digits, and will not start with 0.

There are at most 10 test cases that satisfy the number of digits is larger than 100.

Output

For each test case, you should print the largest probable number that we can get after your swapping.

Sample Input 

                    
                        3
2
1234
4
1234
1
4321

Sample Output 

                3124
4213
4321
            

<span style="color:#330033;"># include <cstdio>
# include <cstring>
# include <iostream>
using namespace std;

int main()
{
    int T;
    cin>>T;
    while(T--)
    {
        int k,i,j,a=0,n,cnt=0;char c[1100],x,Max='.';
        scanf("%d%s",&k,c);
        while(k>1&&a<strlen(c))    //跳出循环条件;k=1时分开讨论;
        {
            if(a+k+1>strlen(c))   n=strlen(c);
            else   n=a+k+1;
            for(i=a+1;i<n;i++)    //找出区间内最大值；
                if(c[i]>c[a]&&c[i]>Max)  { Max=c[i];   j=i; cnt=j-a; }   //cnt记住移了多少次;
            if(Max=='.')   a++;
            else    //更新字符数组;
            {
                for(i=j;i>j-cnt;i--)    c[i]=c[i-1];
                c[a]=Max;
                Max='.';
                k-=cnt;
                a++;
            }
        }
        if(k==1)
        {
            while(c[a]>=c[a+1]&&strlen(c)>(a+1))   a++;
            if(c[a]<c[a+1])
            {
                x=c[a];
                c[a]=c[a+1];
                c[a+1]=x;
            }
        }
        puts(c);
    }
    return 0;
}</span>

原文：http://blog.csdn.net/rechard_chen/article/details/41458347

内容总结

以上是互联网集市为您收集整理的Swap Digits全部内容，希望文章能够帮你解决Swap Digits所遇到的程序开发问题。 如果觉得互联网集市技术教程内容还不错，欢迎将互联网集市网站推荐给程序员好友。

内容备注

版权声明：本文内容由互联网用户自发贡献，该文观点与技术仅代表作者本人。本站仅提供信息存储空间服务，不拥有所有权，不承担相关法律责任。如发现本站有涉嫌侵权/违法违规的内容， 请发送邮件至 gblab@vip.qq.com 举报，一经查实，本站将立刻删除。

内容手机端

扫描二维码推送至手机访问。

本文链接：https://qyyshop.com/info/1103072.html

来源：【匿名】