[算法设计与分析]3.2.6一维二维的选择(链环数字对+花盆摆放)

#include<stdio.h>
#include<iostream>

using namespace std;

void LinkNumber();
void FlowerPot();

int main ()
{
    LinkNumber();
    FlowerPot();
}

void LinkNumber()
{
    int N = 4;
    int num[N] = {1, 5, 9, 5};//{0, 1, 5, 9, 8, 7, 2, 2, 2, 3, 2, 7, 8, 7, 9, 6, 5, 9, 7, 8};

    int counts[10][10] = {0};//计数器 因为num的元素取值范围为0-9因此长度为10
            //计数器必须进行初始化
    for(int i = 0; i < N - 1; i++)
    {
        for(int j = i + 1; j < N; j++)
        {
            counts[num[i]][num[j]]++;
        }
    }
    for(int i = 0; i < 10; i++)
    {
        for(int j = 0; j < 10; j++)
        if(counts[i][j] && counts[j][i])//对称两个均不为0则证明是一个链对
            cout << "(" << i << " , " << j << ")=" << "(" << j << " , " << i << ")" << endl;
    }
}

void FlowerPot()
{//先进行临近花盆的直接交换
    int N = 3;
    int a[N][3] = {1, 3, 2, 2, 1, 3, 3, 1, 2};
    int t;

    for(int i = 0; i < N; i++)
    {//231->312
        if(a[i][0] == 2)
            for(int j = 0; j < N; j++)
            {
                if(a[j][1] == 1)
                {
                    t = a[i][0];
                    a[i][0] = a[j][1];
                    a[j][1] = t;
                    break;
                }
            }
        if(a[i][0] == 3)
        {
            for(int j = 0; j < N; j++)
                if(a[j][2] == 1)
                {
                    t = a[i][0];
                    a[i][0] = a[j][2];
                    a[j][2] = t;
                    break;
                }
        }
        if(a[i][1] == 3)
        {
            for(int j = 0; j < N; j++)
                 if(a[j][2] == 2)
                {
                    t = a[i][1];
                    a[i][1] = a[j][2];
                    a[j][2] = t;
                    break;
                }
        }
    }
    //312->123
    for(int i = 0; i < N; i++)
    {
        if(a[i][0] == 2)
            for(int j = 0; j < N; j++)
            if(a[j][1] == 3)
            for(int k = 0; k < N; k++)
            {
                if(a[j][2] == 1)
                {
                    t = a[i][0];
                    a[i][0] = a[j][1];
                    a[j][1] = a[k][2];
                    a[k][2] = t;
                    break;
                }
            }
        if(a[i][0] == 3)
        for(int j = 0; j < N; j++)
            if(a[j][1] == 1)
            for(int k = 0; k < N; k++)
            {
                if(a[k][2] == 2)
                {
                    t = a[i][0];
                    a[i][0] = a[j][1];
                    a[j][1] = a[k][2];
                    a[k][2] = t;
                    break;
                }
            }
    }
    for(int i = 0; i < N; i++)
    {
        for(int j = 0; j < 3; j++)
            cout << a[i][j] << " ";
        cout <<endl;
    }
}