摘要:
#include <iostream>#include <vector>#include <queue>using namespace std;struct LinkedListNode{ int value; LinkedListNode *pNext; LinkedListNode(int v) : value(v) {}};//创建链表LinkedListNode *CreateLinkedList(int arr[], int len){ LinkedListNode *pHead = new LinkedListNode(arr[0]); Link 阅读全文
摘要:
创建单链表的代码很简单,需要注意的一点是,一开始首先创建一个Node,然后让pPre指向它,并在之后的每次循环中用pCurr进行创建Node(pPre的意义是要将链表连起来)。#include <iostream>#include <vector>#include <queue>using namespace std;struct LinkedListNode{ int value; LinkedListNode *pNext; LinkedListNode(int v) : value(v) {}};LinkedListNode *CreateLinked 阅读全文
摘要:
Crack interview 4.4思想很简单,层序遍历:#include <iostream>#include <vector>#include <queue>using namespace std;struct LinkedListNode{ int value; LinkedListNode *pNext;};struct BTreeNode{ int value; BTreeNode *pLeft; BTreeNode *pRight; BTreeNode(int v) { value = v; pLeft = N... 阅读全文