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; }; 

相关内容

热门资讯

透视系统!wpk是真的还是假的... 透视系统!wpk是真的还是假的,(Wpk)一贯真的有挂(详细模拟器多开)1、每一步都需要思考,不同水...
透视了解!wepoker钻石怎... 透视了解!wepoker钻石怎么看底牌,wepoker有插件吗(详细破解辅助插件)1、首先打开wep...
透视存在!aa poker辅助... 透视存在!aa poker辅助,sohoo poker辅助(果然真的有挂)1、游戏颠覆性的策略玩法,...
透视免费!aapoker ai... 透视免费!aapoker ai插件(透视)透视插件(一贯真的是有挂)1、实时aapoker ai插件...
透视系统!wpk辅助,(WPk... 透视系统!wpk辅助,(WPk)真是真的有挂(详细辅助购买)1)wpk辅助辅助挂:进一步探索wpk辅...
透视玄学!wepoker究竟有... 透视玄学!wepoker究竟有没有透视,wepoker辅助器(详细有透视方法)1)wepoker究竟...
透视app!佛手在线大菠萝技巧... 透视app!佛手在线大菠萝技巧,epoker有透视吗(好像真的是有挂);1、让任何用户在无需佛手在线...
透视系统!aapoker怎么控... 透视系统!aapoker怎么控制牌(透视)透视软件(都是真的是有挂);1、进入到aapoker怎么控...
透视辅助!wpk德州局透视,(... 透视辅助!wpk德州局透视,(WPK)本来存在有挂(详细免费辅助)1)wpk德州局透视辅助挂:进一步...
透视最新!wepokerplu... 透视最新!wepokerplus作弊,黑侠破解wepoker(详细破解器激活码)1、黑侠破解wepo...