在matlab中实现链表

最新推荐文章于 2021-03-25 08:03:12 发布

anjen

最新推荐文章于 2021-03-25 08:03:12 发布

阅读量1.2w

点赞数 4

分类专栏： matlab 文章标签： matlab function list properties methods delete

matlab 专栏收录该内容

1 篇文章 0 订阅

订阅专栏

这几天我们老师让我们用Matlab做作业，需要实现一个链表。
昨天上google搜“matlab 实现链表”，无果,有意思的还有好多乱七八糟的人说Matlab有C/C++的接口，调用C/C++实现的链表就好了。
又搜"matlab linked list",哗啦哗啦，好多用matlab实现链表的内容，尤其是在Matlab帮助中就有一个例子链表的程序。
于是，我有点小感慨 -- 差距。
本着，分享的原则，我把我用Matlab实现的链表分享出来，这样搜关键词“matlab 实现链表”的时候就能搜到结果了。

================================
用Matlab实现链表，的预备知识是：知道Matlab可以面向对象编程。在Matlab帮助中有详细介绍。

dlnode.m 定义了链表中的节点的类

classdef dlnode < handle
% DLNODE A class to represent a doubly-linked list node.
% Multiple dlnode objects may be linked together to create linked listes.
% Each node contains a piece of data and provides access to the next
% and previous nodes.
   properties
      Data
   end
   properties(SetAccess = private)
      Next
      Prev
   end

   methods
      function node = dlnode(Data)
      % DLNODE Constructs a dlnode object.
         if nargin > 0
            node.Data = Data;
         end
      end

      function insertAfter(newNode, nodeBefore)
      % insertAfter Inserts newNode after nodeBefore.
         disconnect(newNode);
         newNode.Next = nodeBefore.Next;
         newNode.Prev = nodeBefore;
         if ~isempty(nodeBefore.Next)
            nodeBefore.Next.Prev = newNode;
         end
         nodeBefore.Next = newNode;
      end

      function insertBefore(newNode, nodeAfter)
      % insertBefore Inserts newNode before nodeAfter.
         disconnect(newNode);
         newNode.Next = nodeAfter;
         newNode.Prev = nodeAfter.Prev;
         if ~isempty(nodeAfter.Prev)
             nodeAfter.Prev.Next = newNode;
         end
         nodeAfter.Prev = newNode;
      end

      function disconnect(node)
      % DISCONNECT Removes a node from a linked list.
      % The node can be reconnected or moved to a different list.
         Prev = node.Prev;
         Next = node.Next;
         if ~isempty(Prev)
             Prev.Next = Next;
         end
         if ~isempty(Next)
             Next.Prev = Prev;
         end
         node.Next = [];
         node.Prev = [];
      end

      function delete(node)
      % DELETE Deletes a dlnode from a linked list.
         disconnect(node);
      end
      function disp(node)
      % DISP Displays a link node.
         disp('Doubly-linked list node with data:')
         disp(node.Data);
      end
   end % methods
end % classdef

doubleLinkedList.m 链表类

classdef doubleLinkedList < handle
   properties (GetAccess = private, SetAccess = private)
      count = 0;
      current = [];
      currentpos = 0;
   end

   methods
       function list = doubleLinkedList()

       end

       function SetPosition(list, p)
           if (p < 0 || p >= list.count)
               error('In SetPosition: Attempt to set a position not in the list.');
           elseif(list.currentpos < p )
               while( list.currentpos ~= p)
                    list.currentpos = list.currentpos + 1;
                    list.current = list.current.Next;
               end
           elseif(list.currentpos > p)
               while( list.currentpos ~= p)
                   list.currentpos = list.currentpos - 1;
                   list.current = list.current.Prev;
               end
           end
       end

       function InsertList(list, p, dlnode)
           if (p < 0 || p > list.count)
               error('In InsertList: Attempt to set a position not in the list.');
           else
               if( list.count == 0)
                   list.current = dlnode;
                   list.currentpos = 0;
               elseif( p == list.count)
                   SetPosition(list, p-1);
                   insertAfter(dlnode, list.current)
               else
                   SetPosition(list, p);
                   insertBefore(dlnode, list.current);
               end
               list.current = dlnode;
               list.currentpos = p;
               list.count = list.count + 1;
           end
       end

       function ClearList(list)
           list.count = 0;
           list.current = [];
           list.currentpos = 0;
       end

       function isEmpty = ListEmpty(list)
           isEmpty = (list.count == 0);
       end

       function size = ListSize(list)
           size = list.count;
       end

       function isFull = ListFull(list)
           isFull = 0;
       end

       function aNode = RetrieveList(list, p)
           SetPosition(list, p);
           aNode = list.current;
       end

       function aNode = DeleteList(list, p)
           SetPosition(list, p);
           aNode = list.current;
           toBeDeleted = list.current;
           if(list.count == 1)
                list.currentpos = 0;
                list.current = [];
           elseif( list.count-1 == p)
               list.current = list.current.Prev;
               list.currentpos = list.currentpos - 1;
           else
                list.current = list.current.Next;
           end
           disconnect(toBeDeleted);
           list.count = list.count - 1;
       end

       function aNode = ReplaceList(list, p, dlnode)
           SetPosition(list, p);
           toBeReplaced = list.current;
           insertBefore(dlnode, list.current);
           list.current = dlnode;
           disconnect(toBeReplaced);
           aNode = toBeReplaced;
       end

       function position = FindFirstInList(list, func)
           found = 0;
           for i = 0:list.count - 1
               SetPosition(list, i);
               if( func(list.current))
                   found = 1;
                   position = i;
                   break;
               end
           end
           if( found == 0)
               position = list.count;
           end
       end

       function TraverseList(list, func)
           for i = 0:list.count - 1
               aNode = RetrieveList(list, i);
               func(aNode);
           end
       end
   end % methods

end % classdef