本例效果图:


unit Unit1; interface uses Windows, Messages, SysUtils, Variants, Classes, Graphics, Controls, Forms, Dialogs, StdCtrls; type TForm1 = class(TForm) Memo1: TMemo; Button1: TButton; Button2: TButton; Button3: TButton; Button4: TButton; procedure Button1Click(Sender: TObject); procedure Button2Click(Sender: TObject); procedure Button3Click(Sender: TObject); procedure Button4Click(Sender: TObject); procedure FormCreate(Sender: TObject); end; var Form1: TForm1; implementation {$R *.dfm} type PMyRec = ^MyRec; MyRec = record Name: string[8]; Age : Word; Link: PMyRec; end; var CurrentNode, FirstNode: PMyRec; {建立链表} procedure TForm1.FormCreate(Sender: TObject); begin New(FirstNode); FirstNode.Name := '李四'; FirstNode.Age := 44; FirstNode.Link := nil; CurrentNode := FirstNode; New(FirstNode); FirstNode.Name := '张三'; FirstNode.Age := 33; FirstNode.Link := CurrentNode; CurrentNode := FirstNode; New(FirstNode); FirstNode.Name := '钱二'; FirstNode.Age := 22; FirstNode.Link := CurrentNode; CurrentNode := FirstNode; New(FirstNode); FirstNode.Name := '赵一'; FirstNode.Age := 11; FirstNode.Link := CurrentNode; CurrentNode := FirstNode; Button1.Caption := '遍历链表'; Button2.Caption := '插入节点'; Button3.Caption := '删除节点'; Button4.Caption := '删除链表'; Memo1.Align := alLeft; Memo1.ScrollBars := ssVertical; end; {遍历链表节点} procedure TForm1.Button1Click(Sender: TObject); begin Memo1.Clear; CurrentNode := FirstNode; while Assigned(CurrentNode) do begin Memo1.Lines.Add(CurrentNode.Name + #9 + IntToStr(CurrentNode.Age)); CurrentNode := CurrentNode.Link; end; end; {插入节点} procedure TForm1.Button2Click(Sender: TObject); var NewNode: PMyRec; begin {譬如是插入在第二个节点后面} CurrentNode := FirstNode.Link; New(NewNode); NewNode.Name := 'AAA'; NewNode.Age := 100; {前后连起来} NewNode.Link := CurrentNode.Link; CurrentNode.Link := NewNode; {调用遍历} Button1.Click; end; {删除节点} procedure TForm1.Button3Click(Sender: TObject); begin {譬如是删除第二个节点} CurrentNode := FirstNode.Link; {让 CurrentNode 指向第二个节点} if Assigned(CurrentNode.Link) then {如果 CurrentNode 还有下一个} begin FirstNode.Link := CurrentNode.Link; {不能断了链} Dispose(CurrentNode); {释放用 New 申请的内存} end; Button1.Click; end; {销毁链表, 释放所有节点} procedure TForm1.Button4Click(Sender: TObject); begin CurrentNode := FirstNode; {从链头向下删除} while Assigned(FirstNode) do begin CurrentNode := FirstNode; FirstNode := CurrentNode.Link; Dispose(CurrentNode); end; Button1.Click; end; end.
分类:
算法与数据结构
【推荐】国内首个AI IDE,深度理解中文开发场景,立即下载体验Trae
【推荐】编程新体验,更懂你的AI,立即体验豆包MarsCode编程助手
【推荐】抖音旗下AI助手豆包,你的智能百科全书,全免费不限次数
【推荐】轻量又高性能的 SSH 工具 IShell:AI 加持,快人一步
· 开发者必知的日志记录最佳实践
· SQL Server 2025 AI相关能力初探
· Linux系列:如何用 C#调用 C方法造成内存泄露
· AI与.NET技术实操系列(二):开始使用ML.NET
· 记一次.NET内存居高不下排查解决与启示
· 阿里最新开源QwQ-32B,效果媲美deepseek-r1满血版,部署成本又又又降低了!
· 开源Multi-agent AI智能体框架aevatar.ai,欢迎大家贡献代码
· Manus重磅发布:全球首款通用AI代理技术深度解析与实战指南
· 被坑几百块钱后,我竟然真的恢复了删除的微信聊天记录!
· 没有Manus邀请码?试试免邀请码的MGX或者开源的OpenManus吧