当前位置:Gxlcms > PHP教程 > PHP实现双向链表、栈,c语言实现双向链表_PHP教程

PHP实现双向链表、栈,c语言实现双向链表_PHP教程

时间:2021-07-01 10:21:17 帮助过:20人阅读

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 "
不能添加相同的编号"; } $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 "
编号:".$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 "
没有找到目标";} } } $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 "
已经满了"; } $this->top++; $this->stack[$this->top]=$val; } public function showStack() { if($this->top==-1) { echo "
栈为空!"; return ; } for($i=$this->top;$i>-1;$i--) { echo "
stack[".$i."]=".$this->stack[$i]; } } public function pop() { if($this->top==-1) { echo "
栈为空!"; return ; } $val=$this->stack[$this->top]; $this->top--; echo "
弹出".$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;
}
}

用链表实现堆栈或队列是什

堆栈或队列数据都需要种容器来盛放
用内置数组来实现队列
int a[100];
入队操作样实现:已有元素全部新元素插入
(当实现效率比较低)

容器选择链表则入队操作样实现:
构造链节点C结构体)要入队元素填入新节点再利用链表插入操作新节点插入链表

用链表实现堆栈或队列盛放数据容器选作链表

人气教程排行