LeetCode707 设计链表
创始人
2024-11-20 13:38:05
0

前言

题目:707. 设计链表
文档:代码随想录——设计链表
编程语言: C++
解题状态: 代码功底不够,只能写个大概

思路

主要考察对链表结构的熟悉程度,对链表的增删改查,比较考验代码功底以及对链表的掌握。本题中的一些边界条件也要注意。

代码

class MyLinkedList { public:     struct ListNode {         int val;         ListNode* next;         ListNode(int x) : val(x), next(nullptr) {}     };      MyLinkedList() {         _dummyHead = new ListNode(0);         _size = 0;     }          int get(int index) {         if (index > (_size - 1) || index < 0) {             return -1;         }          ListNode* cur = _dummyHead -> next;          while (index--) {             cur = cur -> next;         }          return cur -> val;     }          void addAtHead(int val) {         ListNode* newNode = new ListNode(val);          newNode -> next = _dummyHead -> next;         _dummyHead -> next = newNode;          _size++;     }          void addAtTail(int val) {         ListNode* newNode = new ListNode(val);         ListNode* cur = _dummyHead;          while (cur -> next != nullptr) {             cur = cur -> next;         }         cur -> next = newNode;          _size++;     }          void addAtIndex(int index, int val) {         if (index > _size) {             return;         }          ListNode* newNode = new ListNode(val);         ListNode* cur = _dummyHead;         while (index--) {             cur = cur -> next;         }         newNode -> next = cur -> next;         cur -> next = newNode;          _size++;     }          void deleteAtIndex(int index) {         if (index >= _size || index < 0) {             return;         }          ListNode* cur = _dummyHead;         while (index--) {             cur = cur -> next;         }         ListNode* tmp = cur -> next;         cur -> next = cur -> next -> next;         delete tmp;          _size--;     }      void printLinkedList() {         ListNode* cur = _dummyHead;         while (cur -> next != nullptr) {             cout << cur -> next -> val << " ";             cur = cur -> next;         }         cout << endl;     }  private:     int _size;     ListNode* _dummyHead; }; 

相关内容

热门资讯

透视美元局!pokemmo脚本... 透视美元局!pokemmo脚本(透视)安装教程(2021已更新)(哔哩哔哩)1、构建自己的pokem...
透视私人局!wpk俱乐部有没有... 透视私人局!wpk俱乐部有没有辅助(透视)作弊(真是是真的有挂)进入游戏-大厅左侧-新手福利-激活码...
透视透视!wepoker分析(... 透视透视!wepoker分析(透视)wepoker高级辅助(都是真的有挂)1、打开软件启动之后找到中...
透视挂!wepoker透视底牌... 透视挂!wepoker透视底牌脚本(透视)有辅助器(一贯存在有挂)wepoker透视底牌脚本是一种具...
透视有挂!wpk透视辅助靠谱吗... 透视有挂!wpk透视辅助靠谱吗(透视)德州局透视(其实存在有挂);wpk透视辅助靠谱吗辅助器中分为三...
透视app!epoker有透视... 透视app!epoker有透视吗(透视)详细教程(2023已更新)(哔哩哔哩)1、每一步都需要思考,...
透视系统!wepoker怎么获... 透视系统!wepoker怎么获得好牌(透视)wepoker是不是有人用挂(本来是真的有挂);1.we...
透视中牌率!wepoker怎么... 透视中牌率!wepoker怎么开辅助(透视)脚本(一贯存在有挂);一、wepoker怎么开辅助软件透...
透视教程!wpk透视辅助靠谱吗... 透视教程!wpk透视辅助靠谱吗(透视)辅助购买(切实真的有挂)1、实时wpk透视辅助靠谱吗开挂更新:...
透视插件!大菠萝789辅助器下... 透视插件!大菠萝789辅助器下载(透视)安装教程(2026已更新)(哔哩哔哩)1、大菠萝789辅助器...