add some algorithmes

Author: AprilKK

.gitignore

@@ -0,0 +1,3 @@
+*.o
+*.exe
+makefile

SLLst.cpp

@@ -3,31 +3,56 @@
 
 template <class T>
 SLLst<T>::~SLLst() {
-    for (SLLstNode * p;!isEmpty();) {
+    for (SLLstNode<T> * p;!isEmpty();) {
     	p=head->next;
-    	delet head;
+    	delete head;
         head=p;
     }
 }
 template <class T>
-SLLst<T>::addToHead(const T & el) {
-    head=new SLLstNode(el,head);
+void SLLst<T>::addToHead(const T & el) {
+    head=new SLLstNode<T>(el,head);
     if(tail == 0)
     	tail=head;
 }
 template <class T>
+void SLLst<T>::addToTail (const T & el){
+	if(tail!=0){
+		tail->next=new SLLstNode<T>(el,0);
+		tail=tail->next;
+	}
+	else  
+		head=tail=new SLLstNode<T>(el);
+}
+template <class T>
+T SLLst<T>::deletFromHead() {
+	T el= head->info;
+	SLLstNode<T> * tmp =head;
+	if (head==tail) 
+		head=tail=0;
+	else 
+ 		head=head->next;
+	delete tmp;
+	return el;
+}
+template <class T>
 T SLLst<T>::deletFromTail() {
 	T el = tail->info;
 	if (head == tail) {
 		delete head;
 		head =tail =0 ;
 	}
 	else  {
-		SLLstNode * tmp;
+		SLLstNode<T> * tmp;
 		for (tmp = head;tmp->next != tail ; tmp=tmp->next) ;
 			delete tail;
 		    tail =tmp;
 		    tail->next = 0;
 	}
 	return el;
+}
+template <class T>
+bool SLLst<T>::isInList(const T & el) const {
+	for (SLLstNode<T> * tmp = head;tmp!=tail && !(tmp->info==el);tmp=tmp->next) ;
+		return tmp !=0;
 }

SLLst.h

@@ -0,0 +1,90 @@
+#ifndef SLLINKED_LIST
+#define SLLINKED_LIST
+
+template <class T>
+class SLLstNode {
+public:
+	T info;
+	SLLstNode * next;
+	SLLstNode (const T & el,SLLstNode * n=0) {
+		info = el ;next=n;
+	}
+};
+
+template <class T>
+class SLLst
+{
+public:
+	SLLst() { 
+		head=tail=0;
+	}
+	~SLLst();
+	int isEmpty() {
+		return head==0;
+	}
+    void addToHead (const T &);
+    void addToTail (const T &);
+    T    deletFromHead (); 
+    T    deletFromTail ();
+    bool isInList (const T &) const;
+    private:
+    	SLLstNode<T> * head ,* tail;
+	/* data */
+};
+template <class T>
+SLLst<T>::~SLLst() {
+    for (SLLstNode<T> * p;!isEmpty();) {
+    	p=head->next;
+    	delete head;
+        head=p;
+    }
+}
+template <class T>
+void SLLst<T>::addToHead(const T & el) {
+    head=new SLLstNode<T>(el,head);
+    if(tail == 0)
+    	tail=head;
+}
+template <class T>
+void SLLst<T>::addToTail (const T & el){
+	if(tail!=0){
+		tail->next=new SLLstNode<T>(el,0);
+		tail=tail->next;
+	}
+	else  
+		head=tail=new SLLstNode<T>(el);
+}
+template <class T>
+T SLLst<T>::deletFromHead() {
+	T el= head->info;
+	SLLstNode<T> * tmp =head;
+	if (head==tail) 
+		head=tail=0;
+	else 
+ 		head=head->next;
+	delete tmp;
+	return el;
+}
+template <class T>
+T SLLst<T>::deletFromTail() {
+	T el = tail->info;
+	if (head == tail) {
+		delete head;
+		head =tail =0 ;
+	}
+	else  {
+		SLLstNode<T> * tmp;
+		for (tmp = head;tmp->next != tail ; tmp=tmp->next) ;
+			delete tail;
+		    tail =tmp;
+		    tail->next = 0;
+	}
+	return el;
+}
+template <class T>
+bool SLLst<T>::isInList(const T & el) const {
+	SLLstNode<T> * tmp;
+	for (tmp = head;tmp!=tail && !(tmp->info==el);tmp=tmp->next) ;
+		return tmp != 0;
+}
+#endif

main.cpp

@@ -0,0 +1,22 @@
+#include "SLLst.h"
+#include <iostream>
+
+int main ()
+{
+	using namespace std;
+	SLLst<int> aint;
+	int a;
+	cout<<"Please input aint:"<<endl;
+	cin>>a;
+	aint.addToHead(a);
+	while (a!=0) {
+		cout<<"Please input aint:"<<endl;
+		cin>>a;
+		aint.addToHead(a);
+	}
+    
+	cout<<"The info in Head is : "<<endl;
+	cout<<aint.deletFromTail()<<endl;
+	while(1);
+	return 0;
+}