Simple case of PHP linked list operation

This article mainly introduces the operation of PHP linked lists, and analyzes the definition and usage skills of PHP linked lists in the form of simple examples. It has certain reference value. Friends in need can refer to

Running data in PHP Structures are basically simulated using arrays, just using constant thinking.

The problem I encountered today was to merge two linked lists.

Linked list merging renderings

Problem description:A linked list is a template linked list, the length of B linked list is uncertain, A,B The two linked lists are combined to form a C linked list.

Let’s talk about programming ideas: A linked list is a template linked list, so after the operation is completed, the only length remains unchanged. The length of the B linked list is uncertain. Therefore, we can first judge the B linked list in three steps:

Is the B linked list empty?
Is the B linked list shorter or equal to the A linked list?
B linked list Is it longer than A linked list?

Programming is to list as many possibilities as possible. Grab the variable. Due to the question requirement, when the A linked list and the B linked list are equal, the B linked list will be returned directly, so there is no need to consider this issue.

$node = array(
"nameid"=>"",
"shoolid"=>" ",
"depid"=>" ",
"start"=>" ",
"end"=>" "
);
/*
现在上面数据，有的数据存在A链表里面，有的存在B链表里面，如果都没有，用A链表的数据节点来代替。
开始第一次完成的时候，想了一个很蛋痛的方式，还用到arra_diff()函数用这个链表作差。后来仔细思考了一下。
*/
//$data 表示B链表
//$time 表示A链表
//这里为了节约资源，没开第三条链表，而是在B链表中操作,为什么要选一条不确定长度的链表
//看完你就知道为什么了
if(empty($data)) //
{
    //申请节点
    $data = array();
    foreach($time as $value)
    {
      //将A链表的数据进行需求处理，组成我们需要的节点模式
      $array = array("nameid"=>$value["id"],"depid"=>$depid,"schoolid"=>$schoolid,"start"=>"","end"=>"");
      array_push($data,$array); //将新节点压进栈
    }
}
else if(count($data)<=count($time)) //进行长度对比
{
   for($i=0;$i<count($time);$i++) //for循环，不建议在for循环继续动态判断，我这里是偷懒了。
   {
     if(empty($data[$i]))
     {
      //如果数据节点空，则构建节点
      $array = array("nameid"=>$time[$i]["id"],"depid"=>$depid,"schoolid"=>$schoolid,"start"=>"","end"=>"");
      array_push($data,$array);
     }
   }
}

The above algorithm is simply practiced, combining the data of A linked list with the data of B.

Summary: The above is the entire content of this article, I hope it will be helpful to everyone's study.

Related recommendations:

php Debugging SOAP error message under 5.5.12

in PHP HTMLPurifier prevents XSS attacks

Realizing unlimited classification in PHP

The above is the detailed content of Simple case of PHP linked list operation. For more information, please follow other related articles on the PHP Chinese website!