


Detailed example of PHP's member ranking function based on doubly linked lists and sorting operations
This article mainly introduces the member ranking function of PHP based on doubly linked lists and sorting operations. It analyzes the functions and definitions of PHP doubly linked lists and related implementation skills of doubly linked lists based on sorting operations in the form of examples. Friends in need can refer to Next
The example in this article describes the member ranking function implemented by PHP based on doubly linked lists and sorting operations. Share it with everyone for your reference. The details are as follows:
A two-way linked list is also called a double linked list. It is a type of linked list. Each of its data nodes has two pointers, pointing to the direct successor and the direct predecessor. . Therefore, starting from any node in the doubly linked list, you can easily access its predecessor nodes and successor nodes. If you don’t know the concept, please search it yourself.
<?php /** * 双向链表实现用户排行榜 * * 仅用于体现思想逻辑,不具备实际参考价值 * @author 疯狂老司机 * @date 2016-07-07 */ class Rank{ /** * @var 指向前一个节点的引用 */ public $pre = null; /** * @var 指向后一个节点的引用 */ public $next = null; /** * @var 用户排行id */ public $id; /** * @var 用户名称 */ public $username; public function __construct($id = '', $username = ''){ $this->id = $id; $this->username = $username; } /** * 添加成员节点方法 * * @access public * @param obj head 初始节点 * @param obj rank 成员节点 */ public static function addRank($head, $rank){ $cur = $head; // 辅助节点 $isExist = false; //这是一个标志位 while($cur->next != null){ if($cur->next->id > $rank->id){ break; }else if($cur->next->id == $rank->id){ $isExist = true; echo'<br/>不能添加相同的id'; } $cur = $cur->next; } if(!$isExist){ if($cur->next != null){ $rank->next = $cur->next; } $rank->pre = $cur; if($cur->next != null){ $cur->next->pre = $rank; } $cur->next = $rank; } } /** * 删除成员节点方法 * * @access public * @param obj head 初始节点 * @param obj rankid 用户排行id */ public static function delRank($head, $rankid){ $cur = $head->next; $isFind = flase; // 标记位 while($cur != null){ if($cur->id == $rankid){ $isFind = true; break; } $cur = $cur->next; } if($isFind){ if($cur->next != null){ $cur->next->pre = $cur->pre; } $cur->pre->next = $cur->next; echo '<br/>要删除的成员id是'.$cur->id; }else{ echo'<br/>要删除的成员没有'; } } /** * 遍历所有节点并输出显示 * * @access public * @param obj head 初始节点 */ public static function showRank($head){ $cur = $head->next; // 不打印空节点 while($cur->next != null){ echo'<br/>id='.$cur->id.' '.'username='.$cur->username; $cur = $cur->next; } echo'<br/>id='.$cur->id.' '.'username='.$cur->username; } } //创建一个初始节点 $head=new Rank(); //创建一个成员 $rank=new Rank(1,'老王'); Rank::addRank($head,$rank); $rank=new Rank(2,'小明'); Rank::addRank($head,$rank); $rank=new Rank(6,'大熊'); Rank::addRank($head,$rank); $rank=new Rank(3,'静香'); Rank::addRank($head,$rank); $rank=new Rank(56,'孙二娘'); Rank::addRank($head,$rank); echo '<br/>成员排行榜.....'; Rank::showRank($head); echo'<br/>'; echo '<br/>删除后的成员排行榜.....'; Rank::delRank($head,3); Rank::showRank($head); echo'<br/>'; echo'<br/>下面测试删除最前面的和最后面的成员<br/>'; echo '<br/>删除后的成员排行榜.....'; Rank::delRank($head,1); Rank::showRank($head); echo'<br/>'; echo '<br/>删除后的成员排行榜.....'; Rank::delRank($head,56); Rank::showRank($head); ?>
Run results:
Member rankings....
id=1 username= Lao Wang
id=2 username=Xiao Ming
id=3 username=Jingxiang
id=6 username=Big Bear
id=56 username=Sun Erniang
Ranking list of members after deletion .....
The member id to be deleted is 3
id=1 username=老王
id=2 username=Xiao Ming
id=6 username=Big Bear
id=56 username =Sun Erniang
The following test deletes the front and last members
The member ranking after deletion...
The member id to be deleted is 1
id =2 username=Xiao Ming
id=6 username=Big Bear
id=56 username=Sun Erniang
The member ranking after deletion....
The member id to be deleted is 56
id=2 username=Xiao Ming
id=6 username=Big Bear
Related recommendations:
Implementation of JavaScript doubly linked list and doubly circular linked list
Java example code sharing of doubly linked list implementation
An example code of PHP implementation of doubly linked list
The above is the detailed content of Detailed example of PHP's member ranking function based on doubly linked lists and sorting operations. For more information, please follow other related articles on the PHP Chinese website!

Hot AI Tools

Undresser.AI Undress
AI-powered app for creating realistic nude photos

AI Clothes Remover
Online AI tool for removing clothes from photos.

Undress AI Tool
Undress images for free

Clothoff.io
AI clothes remover

Video Face Swap
Swap faces in any video effortlessly with our completely free AI face swap tool!

Hot Article

Hot Tools

Notepad++7.3.1
Easy-to-use and free code editor

SublimeText3 Chinese version
Chinese version, very easy to use

Zend Studio 13.0.1
Powerful PHP integrated development environment

Dreamweaver CS6
Visual web development tools

SublimeText3 Mac version
God-level code editing software (SublimeText3)

Hot Topics

PHP 8.4 brings several new features, security improvements, and performance improvements with healthy amounts of feature deprecations and removals. This guide explains how to install PHP 8.4 or upgrade to PHP 8.4 on Ubuntu, Debian, or their derivati

If you are an experienced PHP developer, you might have the feeling that you’ve been there and done that already.You have developed a significant number of applications, debugged millions of lines of code, and tweaked a bunch of scripts to achieve op

Visual Studio Code, also known as VS Code, is a free source code editor — or integrated development environment (IDE) — available for all major operating systems. With a large collection of extensions for many programming languages, VS Code can be c

JWT is an open standard based on JSON, used to securely transmit information between parties, mainly for identity authentication and information exchange. 1. JWT consists of three parts: Header, Payload and Signature. 2. The working principle of JWT includes three steps: generating JWT, verifying JWT and parsing Payload. 3. When using JWT for authentication in PHP, JWT can be generated and verified, and user role and permission information can be included in advanced usage. 4. Common errors include signature verification failure, token expiration, and payload oversized. Debugging skills include using debugging tools and logging. 5. Performance optimization and best practices include using appropriate signature algorithms, setting validity periods reasonably,

A string is a sequence of characters, including letters, numbers, and symbols. This tutorial will learn how to calculate the number of vowels in a given string in PHP using different methods. The vowels in English are a, e, i, o, u, and they can be uppercase or lowercase. What is a vowel? Vowels are alphabetic characters that represent a specific pronunciation. There are five vowels in English, including uppercase and lowercase: a, e, i, o, u Example 1 Input: String = "Tutorialspoint" Output: 6 explain The vowels in the string "Tutorialspoint" are u, o, i, a, o, i. There are 6 yuan in total

This tutorial demonstrates how to efficiently process XML documents using PHP. XML (eXtensible Markup Language) is a versatile text-based markup language designed for both human readability and machine parsing. It's commonly used for data storage an

Static binding (static::) implements late static binding (LSB) in PHP, allowing calling classes to be referenced in static contexts rather than defining classes. 1) The parsing process is performed at runtime, 2) Look up the call class in the inheritance relationship, 3) It may bring performance overhead.

What are the magic methods of PHP? PHP's magic methods include: 1.\_\_construct, used to initialize objects; 2.\_\_destruct, used to clean up resources; 3.\_\_call, handle non-existent method calls; 4.\_\_get, implement dynamic attribute access; 5.\_\_set, implement dynamic attribute settings. These methods are automatically called in certain situations, improving code flexibility and efficiency.
