一個連結串列的每個結點，有一個next指標指向下一個結點，還有一個random指標指向這個連結串列中的一個隨機結點或者NULL，題目要求實現複製這個連結串列，返回複製後的新連結串列
如圖所示：

1.先將單鏈表複製，如下圖

2.找複雜指標，對新節點複雜指標賦值,如下圖

while (pPre)
    {
        pCur = pPre->pNext;
        if (NULL == pPre->pRandom)
            pCur->pRandom = NULL;
        else
            pCur->
 
pRandom = pPre->pRandom->pNext;
        pPre = pCur->pNext;
    }

3.拆結點，如下圖

pPre = p1;
    Node* pPre2 = pPre->pNext;
    pCur = pPre->pNext;
    while (pCur->pNext)
    {
        pPre->pNext = pCur->pNext;
        pPre = pCur->pNext;
        pCur->pNext = pPre->
 
pNext;
        pCur = pCur->pNext;
    }

程式碼如下：

//結構體
typedef int DataType;

typedef struct ListNode
{
    struct ListNode* pNext;
    struct ListNode* pRandom;
    DataType data;
}Node;

Node* BuyNode1(DataType d)
{
    Node* NewNode = (Node*)malloc(sizeof(Node));
    if (NewNode)
    {
        NewNode->
 
data = d;
        NewNode->pNext = NULL;
        NewNode->pRandom = NULL;
        return NewNode;
    }
    else
    {
        perror("malloc::BuyNode");
        return NULL;
    }
}

Node* CopyComplexLinkList(Node* p1)//複製複雜連結串列
{
    Node* pPre = p1;
    Node* NewNode = NULL;
    Node* pCur = NULL;
    //在原連結串列每個節點後與此節點相同的新節點
    while (pPre)
    {
        NewNode = BuyNode1(pPre->data);
        NewNode->pNext = pPre->pNext;
        pPre->pNext = NewNode;
        pPre = NewNode->pNext;
    }
    //給新結點隨機指標域賦值
    pPre = p1;
    while (pPre)
    {
        pCur = pPre->pNext;
        if (NULL == pPre->pRandom)
            pCur->pRandom = NULL;
        else
            pCur->pRandom = pPre->pRandom->pNext;
        pPre = pCur->pNext;
    }
    //將新結點拆下來
    pPre = p1;
    Node* pPre2 = pPre->pNext;
    pCur = pPre->pNext;
    while (pCur->pNext)
    {
        pPre->pNext = pCur->pNext;
        pPre = pCur->pNext;
        pCur->pNext = pPre->pNext;
        pCur = pCur->pNext;
    }
    return pPre2;
}

//test.c

void ComplexLinkList_test()
{
    Node node1, node2, node3, node4;
    node4.data = 4;
    node4.pNext = NULL;
    node4.pRandom = NULL;

    node3.data = 3;
    node3.pNext = &node4;
    node3.pRandom = &node3;

    node2.data = 2;
    node2.pNext = &node3;
    node2.pRandom = &node1;


    node1.data = 1;
    node1.pNext = &node2;
    node1.pRandom = &node3;



    Node* ret = CopyComplexLinkList(&node1);

}