编辑代码

#include <iostream>
using namespace std;

struct ListNode
{
    int m_nValue;
    ListNode *m_pNext;
};

void AddToTail(ListNode** pHead,int value )
{
    ListNode* pNew = new ListNode();
    pNew->m_nValue = value;
    pNew->m_pNext = NULL;

    //改变链表的头结点
    if(*pHead == NULL)
    {
        *pHead = pNew;
        *pHead = (*pHead)->m_pNext;
    }
    else
    {
        //找到链表的尾结点
        ListNode *pNode = *pHead;
        while(pNode->m_pNext != NULL)
        {
            pNode = pNode->m_pNext;
        }
        pNode->m_pNext = pNew;
    }
}

int main() {
    //JSRUN引擎2.0，支持多达30种语言在线运行，全仿真在线交互输入输出。 
	cout << "Hello JSRUN!   \n\n         - from C++ ." << endl;
	return 0;
}