常用数据结构，如Link,Stack,Queue

Author: wrchow

.gitignore

@@ -1,8 +1,15 @@
 *.o
+*.jar
+*.out
 *.stackdump
 *.obj
 *.swp
 *.exe	
+*.out
+*.dat
+
 
 data/
+tmp/
+
 

datastruct/BTree.cpp

@@ -0,0 +1,7 @@
+/**
+@20140223 18:31~
+
+1. 二叉树的遍历；
+*/
+
+

datastruct/Link.cpp

@@ -0,0 +1,148 @@
+/**
+@20140220
+
+1. 链表有个头指针；
+2. 链表插入，删除操作；
+3. 链接反转；
+
+api:get(x);remove(x);add(x);print();del(x);reverse();
+*/
+
+#include <iostream>
+using namespace std;
+
+class Node {
+public:
+	Node() {
+		next = NULL;
+	}
+	int value;
+	Node* next;
+};
+
+class Link {
+public:
+	Link() {
+	// error1: 初始化
+		m_head = new Node();
+		m_size = 0;
+	}
+
+	bool empty() {
+		return m_head->next == NULL;
+	}
+
+	int get(int x);
+
+	void add(int x); 
+
+	void print(); 
+	
+	// 删除位于x的元素
+	bool remove(int x); 
+
+	// 删除第一个值为x的元素
+	int del(int x); 
+
+	void reverse(); 
+
+	int size() {
+		return m_size;
+	}
+
+private:
+	int m_size;
+	Node* m_head;
+};
+
+int Link::get(int x) {
+	if (x >= 0 && x < m_size) {
+		Node* p = m_head->next;
+		while (x > 0 && p->next != NULL) {
+			p = p->next;
+			x --;
+		}
+		if (x == 0) {
+			return p->value;
+		}
+	} else {
+		throw std::overflow_error("x is exceed index!");
+	}
+// implicit conversion of NULL constant to 'int'
+	return NULL;
+}
+
+bool Link::remove(int x) {
+	if (x >= 0 && x < m_size) {
+		Node* p = m_head->next;
+		Node* pre = m_head;
+		while (x > 0) {
+			pre = p;
+			p = p->next;
+			x--;
+		}		
+		if (x == 0 && p != NULL) {
+			pre->next = p->next;
+		} else {
+			pre->next = NULL;
+		}
+		delete p;
+	}
+	m_size--;
+	return false;	
+}
+
+
+void Link::reverse() {
+	Node* p = m_head->next;
+	Node* pre = NULL; 
+	while (p != NULL) {
+		Node* pNext = p->next;
+		if (pNext == NULL) {
+			//error: m_head = pNext;
+			m_head->next = p;
+		}
+		p->next = pre; 	
+		pre = p;
+		p = pNext;
+	}	
+}
+
+void Link::print() {
+	// error2: 头指针不清晰
+	Node* p = m_head->next;
+	while (p != NULL) {
+		cout << p->value << "->";
+		p = p->next;
+	}
+	cout << endl;
+}
+
+
+void Link::add(int x) {
+	Node* p = m_head;
+	while (p->next != NULL) {
+		p = p->next;
+	}	
+	Node* q = new Node();
+	q->value = x;
+	p->next = q;
+	m_size++;
+}	
+
+int Link::del(int x) {
+	Node* p = m_head->next;
+	// error3: || -> &&
+	while (p->next != NULL && p->next->value != x) {
+		p = p->next;
+	}
+	if (p->next == NULL) {
+		return -1;
+	} else {
+		Node* q = p->next;
+		p->next = q->next;
+		delete q;
+	}
+	m_size--;
+	return 0;
+}

datastruct/heap.c

@@ -0,0 +1,100 @@
+// msbd 13.1
+// create/length/print single link
+// 2014-01-31
+
+#include <iostream>
+
+using namespace std;
+
+class Link {
+public:
+	Link() {
+		m_head = new Node();
+		m_length = 0; 
+	}
+
+	int size();
+	void push_back(const char v);
+	void print_link();
+	void remove(int i);
+	void insert(int i, const char v);
+
+private:
+	struct Node {
+		char value;
+		Node* next;
+		Node():next(NULL){}
+		Node(char v) {
+			value = v;
+		}
+	};
+private:
+	Node* m_head;
+	int m_length;
+};
+
+int Link::size()
+{
+	return m_length;	
+}
+
+void Link::remove(int i) 
+{
+	if (i < 0 || i >= m_length) {
+		cout << "nothing to remove.." << endl;	
+		return;
+	}
+	if (i == 0) {
+		Node* p = m_head->next;
+		m_head->next = NULL;
+		delete p;
+	} else {
+		Node* p = m_head->next;
+		while (--i) {
+			p = p->next;	
+		}
+		Node* q = p->next;
+		p->next = p->next->next;
+		delete q;
+	} 
+	m_length --;
+	cout << "remove success" << endl;	
+} 
+
+void Link::push_back(const char v)
+{
+	Node* p = m_head;
+	Node* p2;	
+	while(p != NULL) {
+		p2 = p;
+		p = p->next;
+	}	
+	Node* add = new Node(v);
+	p2->next = add;
+	m_length++;
+} 
+
+void Link::print_link() 
+{
+	Node* p = m_head;
+	while(p != NULL) {
+		cout << p->value << "->";
+		p = p->next;
+	}
+	cout << endl;
+}
+
+int main()
+{
+	Link* link = new Link();
+	link->push_back('a');	
+	link->push_back('b');	
+	link->push_back('c');	
+	link->push_back('d');	
+	link->print_link();	
+	link->remove(2);
+	link->print_link();
+	cout << "len: " << link->size() << endl;
+}
+
+

datastruct/link1.cpp

@@ -0,0 +1,95 @@
+/**
+@20140220
+
+1. 链表有个头指针；
+2. 链表插入，删除操作；
+3. 链接反转；
+*/
+
+#include <iostream>
+using namespace std;
+
+class Node {
+public:
+	Node() {
+		next = NULL;
+	}
+	char value;
+	Node* next;
+};
+
+class Link {
+public:
+	Link() {
+	// error1: 初始化
+		m_head = new Node();
+	}
+
+	void add(char x) {
+		Node* p = m_head;
+		while (p->next != NULL) {
+			p = p->next;
+		}	
+		Node* q = new Node();
+		q->value = x;
+		p->next = q;
+	}	
+
+	void print() {
+	// error2: 头指针不清晰
+		Node* p = m_head->next;
+		while (p != NULL) {
+			cout << p->value << "->";
+			p = p->next;
+		}
+		cout << endl;
+	}
+	
+	int del(char x) {
+		Node* p = m_head->next;
+		// error3: || -> &&
+		while (p->next != NULL && p->next->value != x) {
+			p = p->next;
+		}
+		if (p->next == NULL) {
+			return -1;
+		} else {
+			Node* q = p->next;
+			p->next = q->next;
+			delete q;
+		}
+		return 0;
+	}
+
+	void reverse() {
+		Node* p = m_head->next;
+		Node* pre = NULL; 
+		while (p != NULL) {
+			Node* pNext = p->next;
+			if (pNext == NULL) {
+				//error: m_head = pNext;
+				m_head->next = p;
+			}
+			p->next = pre; 	
+			pre = p;
+			p = pNext;
+		}	
+	}
+
+private:
+	Node* m_head;
+};
+
+int main()
+{
+	Link link;
+	link.add('a');
+	link.add('b');
+	link.add('c');
+	link.add('d');
+	link.print();
+	link.del('c');
+	link.print();
+	link.reverse();
+	link.print();
+}