queue.cpp

.gitignore

@@ -1,9 +1,5 @@
-*
-!*.c
-!*.cpp
-!*.sh
-!README
-!.gitignore
-!makefile
+*.[oa]
+*~
+.*.c.swp
 资料/
-
+*.[zip|tar]

c++/mymakefile

@@ -0,0 +1,7 @@
+queue:queue.o
+	g++ -o queue queue.o
+queue.o:queue.cpp
+	g++ -c -g -Wall queue.cpp
+clean:
+	rm *.o
+

c++/queue/makefile

@@ -0,0 +1,7 @@
+queue:queue.o
+	g++ -o queue queue.o
+queue.o:queue.cpp
+	g++ -c -g -Wall queue.cpp
+clean:
+	rm *.o
+

c++/queue/queue.cpp

@@ -11,25 +11,26 @@ class QUEUE
 	};
 	NODE *front,*rear;
 	public:
-	    QUEUE();
+	    QUEUE()
+	    {
+			front=rear=NULL;
+			cout<<"queue()\n";
+        }
 		~QUEUE();
 		int insert(char v);
 		int remove(char &v);
 		int empty();
-		//int destroy();
 };
 QUEUE::NODE::NODE(char v)
 {
 	elem=v;
-	next=0;
-}
-QUEUE::QUEUE()
-{
-	front=rear=0;
+	next=NULL;
 }
+
+
 QUEUE::~QUEUE()
 {
-	NODE *p;
+	NODE *p=NULL;
 	while(front)
 	{
 		p=front->next;
@@ -40,13 +41,19 @@ QUEUE::~QUEUE()
 int QUEUE::insert(char v)
 {
 	NODE *p=new NODE(v);
-	if(p==0)return 0;
-	rear->next=p;
-	p->next=0;
+	if(p==NULL)return 0;
+	if(front==NULL){
+		front=p;
+	}
+	else{
+			rear->next=p;
+
+	}
 	rear=p;
-	printf("%c\n",p->elem);
+	//cout<<v;
 	return 1;
 }
+
 int QUEUE::remove(char &c)
 {
 	NODE *p=front;
@@ -57,16 +64,16 @@ int QUEUE::remove(char &c)
 }
 int QUEUE::empty()
 {
-	if(front==rear==0)return 1;
+	if(front==NULL&&rear==NULL)return 1;
 	else return 0;
 }
 
 int main(void)
 {
 	QUEUE q;
-	int v;
-	q.insert(5);
-	q.insert(6);
+	char v;
+	q.insert('a');
+	q.insert('b');
 
 }
 

shell/b2d.sh

@@ -17,6 +17,10 @@ error()
     echo "$1"
     exit 1
 }
-
+while [ -n "$1" ] ;do
+case $1 in
+	-h)help;shift $1;;#shift 是去除$1,把$2变成$1
+esac
+done
 #
 

shell/nso

@@ -0,0 +1,17 @@
+zhang love
+xue
+fei  3
+xue
+zhang love
+is
+a
+good
+people
+8
+3
+9
+4
+2
+0
+7
+8

shell/so

@@ -0,0 +1,20 @@
+zhang love
+zhang love
+zhang love
+xue
+fei  3
+xue
+zhang love
+is
+is
+a
+good
+people
+8
+3
+9
+4
+2
+0
+7
+8