原地排列字符串

将字符串abcde12345 inplace的转换为  a1b2c3d4e5

我的想法是整块整块的向后平移

首先bcde平移，将1放入正确位置

将cde平移，将2放入正确位置

....

网上的做法比较高效

先算出当前字符的正确位置，然后将当前字符放到正确位置上，然后再计算被替换位置的正确位置

int ClacTarget(int nLen, int nIndex)
{
        assert(nLen > 0 && nIndex > 0 && nLen > nIndex);

        if (nIndex < nLen/2)
                return 2 * nIndex;

        return (nIndex - nLen/2) * 2 + 1;
}

char* InplaceConvert(char* str)
{
        if (NULL == str)
                return NULL;

        int nLen = strlen(str);
        if (0 == nLen || nLen%2 != 0)
                return str;

        int nCount = nLen - 2;
        for (int i = 1; i < nLen && nCount > 0; i += 2)
        {
                int nCur = ClacTarget(nLen, i);
                char cTmp = str[nCur];
                str[nCur] = str[i];
                nCount--;

                while (nCur != i)
                {
                        nCur = ClacTarget(nLen, nCur);
                        char c = str[nCur];
                        str[nCur] = cTmp;
                        cTmp = c;
                        nCount--;
                }
        }
         
        return str;
}