排序、位置变换

最新推荐文章于 2021-10-26 23:34:09 发布

H_BING

最新推荐文章于 2021-10-26 23:34:09 发布

阅读量415

点赞数

分类专栏： C-C++解题技巧

本文链接：https://blog.csdn.net/H_BING/article/details/50931339

版权

C-C++解题技巧专栏收录该内容

2 篇文章 0 订阅

订阅专栏

1、组合成最小数字

题目
注意：不可简单判断两个字符串ASCII码大小然后按字典序输出。
代码如下

#include <iostream>
#include <string>
using namespace std;
string str[200];
int main()
{
    int m;
    int i, j;
    string _str;
    int min;//记录排序最小的位置

    cin >> m;
    for (i = 0; i < m; i++) {
        cin >> str[i] ;
    }

    //类似比较数字大小进行字符串大小比较并交换顺序
    for (i = 0; i < m; i++) {

        _str = str[i];
        min = i;

        for (j = i; j < m; j++) {
            //判断最小组合数
            if ((_str + str[j])>(str[j] + _str)) {
                _str = str[j];
                min = j;
            }
        }

        //交换位置
        str[min] = str[i];
        str[i] = _str;
    }

    for (i = 0; i < m; i++) {
        cout << str[i];
    }

    cout << endl;
    return 0;
}

/*
     *****判断最小组合数*****

     if (_str > str[j]) {
         _str = str[j];
         min = j;
     }

     ******错误做法原因******
     例如当1和100比较时会输出1100而非1001
 */

2、矩阵坐标变换

特殊角度
- 代码如下

#include<iostream>  
using namespace std;

int main() {
    int n;
    int i, j;
    int x1 = 0, x2 = 0, x3 = 0;
    cin >> n;

    cout << endl << "初始坐标：" << endl;
    for (i = 1; i <= n; i++) {
        for (j = 1; j <= n; j++) {
            cout << "(" << i << "," << j << ") ";
        }
        cout << endl;
    }
    cout << endl;

    cout << "顺时针转90°：" << endl;
    for (i = 1; i <= n; i++) {
        for (j = 1; j <= n; j++) {
            cout << "(" << n - j + 1 << "," << i << ") ";
        }
        cout << endl;
    }
    cout << endl;   

    cout << "逆时针转90°：" << endl;
    for (i = 1; i <= n; i++) {
        for (j = 1; j <= n; j++) {
            cout << "(" << j << "," << n - i + 1 << ") ";
        }
        cout << endl;
    }
    cout << endl;

    cout << "顺/逆时针转180°：" << endl;
    for (i = 1; i <= n; i++) {
        for (j = 1; j <= n; j++) {
            cout << "(" << n - i + 1 << "," << n - j + 1 << ") ";
        }
        cout << endl;
    }
    cout << endl;

    cout << "水平翻转：" << endl;
    for (i = 1; i <= n; i++) {
        for (j = 1; j <= n; j++) {
            cout << "(" << i << "," << n - j + 1 << ") ";
        }
        cout << endl;
    }
    cout << endl;

    return 0;
}