7单链表交换任意两个元素（不包括表头）

//单链表交换任意两个元素(不包括表头)
#include <iostream>
using namespace std;

struct LinkNode
{
	LinkNode *pNext;
	int nValue;
	LinkNode(int value = 0)
	{
		nValue = value;
		pNext = NULL;
	}
};

class Linklist
{
public:
	Linklist(){ pHead = new LinkNode(); };
	~Linklist(){ delete pHead;}; 
	void InsertValue(int nValue);
	void Reverse();
	void Reverse2();
	LinkNode *FindLastNum(int nNum);
	LinkNode *FindMidNode(bool &IsOdd);
	void DeleteNode(LinkNode *pDel);
	Linklist* Mergelist(const Linklist &list) const;
	void SwapNode(LinkNode *p1, LinkNode *p2);
	void Print();

private:
	LinkNode *pHead;
};


void Linklist::InsertValue(int nValue)
{
	if (pHead == NULL)
	{
		return;
	}
	LinkNode *pCur = pHead;
	while (pCur->pNext != NULL)
	{
		pCur = pCur->pNext;
	}

	LinkNode *pTmp = new LinkNode(nValue);
	pCur->pNext = pTmp;
}

void Linklist::Reverse()
{
	if (pHead == NULL)
	{
		return;
	}

	//特殊情况:如果链表为空或