迎接2012之集合和泛型(4)------栈的链式结构基本实现

一、非泛型实现

using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
using System.IO;
using System.Data;
using System.Data.SqlClient;
using System.Text.RegularExpressions;
using System.Reflection;

namespace ConsoleApplication
{
    class Program
    {
        static void Main(string[] args)
        {
            Stack s = new Stack();
            s.Push(3);
            s.Push(4);
            s.Push(5);
            Node node = s.index;
            while (node != null)
            {
                Console.WriteLine(node.Data);
                node = node.next;
            }
            Console.WriteLine(s.Peek());
            Console.WriteLine(s.Pop());
        }
    }
    /// <summary>
    /// 栈的链式结构基本实现(非泛型)
    /// </summary>
    public class Stack
    {
        /// <summary>
        /// 元素的下标
        /// </summary>
        public Node index;
        /// <summary>
        /// 统计个数
        /// </summary>
        private int count;
        public int Count
        {
            get { return count; }
        }
        /// <summary>
        /// 默认的构造函数
        /// </summary>
        public Stack()
        {
            this.index = null;
            this.count = 0;
        }
        /// <summary>
        /// 入栈
        /// </summary>
        /// <param name="obj"></param>
        public void Push(object obj)
        {
            Node node = new Node(obj);
            if (index == null)
            {
                index = node;
            }
            else
            {
                node.next = index;
                index = node;
            }
            this.count++;
        }
        /// <summary>
        /// 出栈
        /// </summary>
        public object Pop()
        {
            Node result = index;
            if (index != null)
            {
                index = index.next;
                count--;
                return result.Data;
            }
            else
            {
                Console.WriteLine("元素不存在");
                return null;
            }
        }
        /// <summary>
        /// 查找元素是否存在
        /// </summary>
        /// <param name="obj"></param>
        /// <returns></returns>
        public bool Contains(object obj)
        {
            bool b = false;
            Node node = index;
            while (node != null && node.Data != null)
            {
                if (node.Equals(obj))
                {
                    b = true;
                }
                node = node.next;
            }
            return b;
        }
        /// <summary>
        /// 取栈顶
        /// </summary>
        public object Peek()
        {
            if (index != null)
            {
                return index.Data;
            }
            else
            {
                Console.WriteLine("元素不存在");
                return null;
            }
        }
    }
    /// <summary>   
    /// 节点类   
    /// </summary>   
    public class Node
    {
        public object Data
        {
            get;
            set;
        }
        internal Node next;
        public Node()
        {
            Data = "";
            next = null;
        }
        public Node(object data, Node next)
        {
            Data = data;
            this.next = next;
        }
        public Node(object data)
        {
            Data = data;
            next = null;
        }
    }

}

二、泛型实现

using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
using System.IO;
using System.Data;
using System.Data.SqlClient;
using System.Text.RegularExpressions;
using System.Reflection;

namespace ConsoleApplication
{
    class Program
    {
        static void Main(string[] args)
        {
            Stack<int> s = new Stack<int>();
            s.Push(3);
            s.Push(4);
            s.Push(5);
            Node<int> node = s.index;
            while (node != null)
            {
                Console.WriteLine(node.Data);
                node = node.next;
            }
            Console.WriteLine(s.Peek());
            Console.WriteLine(s.Pop());
        }
    }
    /// <summary>
    /// 栈的链式结构基本实现(泛型)
    /// </summary>
    public class Stack<T>
    {
        /// <summary>
        /// 元素的下标
        /// </summary>
        public Node<T> index;
        /// <summary>
        /// 统计个数
        /// </summary>
        private int count;
        public int Count
        {
            get { return count; }
        }
        /// <summary>
        /// 默认的构造函数
        /// </summary>
        public Stack()
        {
            this.index = null;
            this.count = 0;
        }
        /// <summary>
        /// 入栈
        /// </summary>
        /// <param name="obj"></param>
        public void Push(T obj)
        {
            Node<T> node = new Node<T>(obj);
            if (index == null)
            {
                index = node;
            }
            else
            {
                node.next = index;
                index = node;
            }
            this.count++;
        }
        /// <summary>
        /// 出栈
        /// </summary>
        public T Pop()
        {
            Node<T> result = index;
            if (index == null)
            {
                Console.WriteLine("元素不存在");
            }
            index = index.next;
            count--;
            return result.Data;
        }
        /// <summary>
        /// 查找元素是否存在
        /// </summary>
        /// <param name="obj"></param>
        /// <returns></returns>
        public bool Contains(T obj)
        {
            bool b = false;
            Node<T> node = index;
            while (node != null && node.Data != null)
            {
                if (node.Equals(obj))
                {
                    b = true;
                }
                node = node.next;
            }
            return b;
        }
        /// <summary>
        /// 取栈顶
        /// </summary>
        public T Peek()
        {
            if (index == null)
            {
                Console.WriteLine("元素不存在");
            }
            return index.Data;
        }
    }
    /// <summary>   
    /// 节点类   
    /// </summary>   
    public class Node<T>
    {
        public T Data
        {
            get;
            set;
        }
        internal Node<T> next;
        public Node(T data, Node<T> next)
        {
            Data = data;
            this.next = next;
        }
        public Node(T data)
        {
            Data = data;
            next = null;
        }
    }

}