数据结构思考

问题：已知一维数组A[m+n]中依次存放 两个线性表
前m项： a1,a2,a3 … am
后n项：b1,b2,b3 … bn
如何将前m项元素与后n项交换位置???

思路整理

m = kn + z
n = km + z

例一：
1 2 3 & 4 5 6 7 8 9 10 11

4 5 6 & 1 2 3 7 8 9 10 11
4 5 6 7 8 9 & 1 2 3 10 11
4 5 6 7 8 9 10 11 3 & 1 2

3 & 1 2
1 3 & 2
1 2 3 &

例二：
1 2 3 & 4 5 6 7 8 9 10

4 5 6 & 1 2 3 7 8 9 10
4 5 6 7 8 9 & 1 2 3 10
4 5 6 7 8 9 10 2 3 & 1

2 3 & 1
1 3 & 2
1 2 3 &

代码1

void swapArray(char **pString, int start, int len, int _start, int _len, int sum) {
    if (len <= _len) { //前m项少于后n项
        int i = 0, j = 0;
        char *temp;
        for (; j < _len; ++i, ++j) {
            temp = pString[start + i];
            pString[start + i] = pString[_start + j];
            pString[_start + j] = temp;
        }//j
        int len1 = _len % len;
        if (len1 == 0) return;
        int len2 = len - len1;
        swapArray(pString, start + i, len2, _start + j - len1, len1, sum);//
    } else {//前m项多于后n项
        int i = 0, j = 0;
        char *temp;
        for (; i < len; ++i, j = (++j % _len)) {
            temp = pString[start + i];
            pString[start + i] = pString[_start + j];
            pString[_start + j] = temp;
        }//j

        int len1 = len % _len;
        if (len1 == 0) return;
        int len2 = _len - len1;
        swapArray(pString, start + i, len1, _start + j , len2, sum);
    }
}

代码2

总体逆置
前n项逆置，后m项逆置

void reverseArray(char **pString, int start, int end) {

    char *temp;
    for (int i = start, j = end - 1; i < j; ++i, --j) {
        temp = pString[i];
        pString[i] = pString[j];
        pString[j] = temp;
    }
}

一比较，简直结果搞了个废物！！！