程式師世界 >> 編程語言 >> 網頁編程 >> PHP編程 >> 關於PHP編程 >> PHP實現雙向鏈表、棧，c語言實現雙向鏈表

PHP實現雙向鏈表、棧，c語言實現雙向鏈表

編輯：關於PHP編程

PHP實現雙向鏈表、棧，c語言實現雙向鏈表

前期寫過一個PHP實現單向鏈表、實現排序單向鏈表的一篇文章，傳送門：http://www.cnblogs.com/yydcdut/p/3777760.html。雙向鏈表寫過了，再拿出來提一提：http://www.cnblogs.com/yydcdut/p/3782661.html。

這次再來分享一下實現雙向鏈表和棧的實現。代碼雖然是以前寫的了，但是發現PHP寫的這些代碼很容易看懂！

雙向鏈表

<?php
        //雙向鏈表
        class Hero
        {
            public $pre=null;//前指針
            public $no;//排名
            public $name;//名字
            public $next=null;//後指針
            
            /**
            *構造函數，申明鏈表頭
            */
            public function __construct($no='',$name='')
            {
                $this->no=$no;
                $this->name=$name;
            }
            /**
            *插入
            */
            static public function addHero($head,$hero)
            {
                $cur = $head;
                $isExist=false;
                //判斷目前這個鏈表是否為空
                if($cur->next==null)
                {
                    $cur->next=$hero;
                    $hero->pre=$cur;
                }
                else
                {
                    //如果不是空節點，則安排名來添加
                    //找到添加的位置            
                    while($cur->next!=null)
                    {
                        if($cur->next->no > $hero->no)
                        {//如果大於了排名，跳出
                            break;
                        }
                        else if($cur->next->no == $hero->no)
                        {//如果等於排名，則代表有這個元素了
                            $isExist=true;
                            echo "<br>不能添加相同的編號";
                        }
                        $cur=$cur->next;
                    }
                    if(!$isExist)
                    {//如果元素不存在，執行插入操作
                        if($cur->next!=null)
                        {$hero->next=$cur->next;}
                        $hero->pre=$cur;
                        if($cur->next!=null)
                        {$hero->next->pre=$hero;}
                        $cur->next=$hero;            
                    }
                }
            }
            //遍歷
            static public function showHero($head)
            {
                $cur=$head;
                while($cur->next!=null)
                {
                    echo "<br>編號：".$cur->next->no."名字：".$cur->next->name;
                    $cur=$cur->next;
                }
            }        
            static public function delHero($head,$herono)
            {
                $cur=$head;
                $isFind=false;
                while($cur!=null)
                {
                    if($cur->no==$herono)
                    {
                        $isFind=true;
                        break;
                    }
                    //繼續找
                    $cur=$cur->next;
                }
                if($isFind)
                {
                    if($cur->next!=null)
                    {$cur->next_pre=$cur->pre;}
                    $cur->pre->next=$cur->next;
                }
                else
                {echo "<br>沒有找到目標";}            
            }
        }
        $head = new Hero();
        $hero1 = new Hero(1,'1111');
        $hero3 = new Hero(3,'3333');
        $hero2 = new Hero(2,'2222');
        Hero::addHero($head,$hero1);
        Hero::addHero($head,$hero3);
        Hero::addHero($head,$hero2);
        Hero::showHero($head);
        Hero::delHero($head,2);
        Hero::showHero($head);
?>

雙向鏈表的插入操作示意圖：

if($cur->next!=null)
    $hero->next=$cur->next;
$hero->pre=$cur;
 if($cur->next!=null)
    $hero->next->pre=$hero;
$cur->next=$hero;

if($cur->next!=null) $cur->next->pre=$cur->pre; $cur->pre->next=$cur->next;

棧

<?php

    class myStack
    {
        private $top=-1;
        private $maxSize=5;
        private $stack=array();
        public function push($val)
        {
            if($this->top == $this->maxSize)
            {
                echo "<br>已經滿了";
            }
            $this->top++;
            $this->stack[$this->top]=$val;
        }
        
        public function showStack()
        {
            if($this->top==-1)
            {
                echo "<br>棧為空！";
                return ;
            }
            for($i=$this->top;$i>-1;$i--)
            {
                echo "<br>stack[".$i."]=".$this->stack[$i];
            }
        }
        
        public function pop()
        {
            if($this->top==-1)
            {
                echo "<br>棧為空！";
                return ;
            }
            
            $val=$this->stack[$this->top];
            $this->top--;
            echo "<br>彈出".$val;
        }
    }

    $mystack = new myStack;
    $mystack->push('111');
    $mystack->push('222');
    $mystack->showStack();
    $mystack->pop();
    $mystack->pop();
?>

我是天王蓋地虎的分割線

《PHP實現鏈表》傳送門：http://www.cnblogs.com/yydcdut/p/3777760.html

轉載請注明出處：轉載請注明出處：http://www.cnblogs.com/yydcdut

java 中用雙向鏈表模擬棧

裡只

實現了Stack

部分功能

public class Stack{

private Node top;

public Stack(){
this.top = null;
}

public void push(Node node){
if(node == null)
return;
if(this.top == null){
this.top = node;
node.setNext(null);
node.setPre(null);
}
else{
this.top.setNext(node);
node.setPre(this.top);
node.setNext(null);
this.top = node;
}
}

public Node pop(){
if(this.top == null)
return null;
Node curr = this.top;
Node pre = curr.getPre();
pre.setNext(null);
this.top = pre;
return curr;
}

public Node top(){
return this.top;
}

public boolean isEmpty(){
return this.top == null ? true : false;
}

public void empty(){
this.top = null;
}

public static void main(String[] args){
Stack stack = new Stack();
Node n1 = new Node(1);
Node n2 = new Node(2);
Node n3 = new Node(3);

System.out.println(stack.isEmpty());
stack.push(n1);
System.out.println(stack.top().getValue());
stack.push(n2);
stack.push(n3);
System.out.println(stack.pop().getValue());
stack.empty();
}
}

class Node {
private int value;
private Node next;
private Node pre;

public Node(int value, Node next, Node pre){
this.value = value;
this.next = next;
this.pre = pre;
}

public Node(int value){
this.value = value;
this.next = null;
this.pre = null;
}

public int getValue() {
return value;
}

public void setValue(int value) {
this.value = value;
}

public Node getNext() {
return next;
}

public void setNext(Node next) {
this.next = next;
}

public Node getPre() {
return pre;
}

public void setPre(Node pre) {
this.pre = pre;
}
}