707. Design Linked List

在这道题翻船了（；´д｀）ゞ
我太垃圾了，晚上二刷。

二刷

卡壳？

为什么翻船了呢，看下面代码：

struct node{int val;node* next;
}
class link{
public:link(){dummy = new node();dummy->val = -1;dummy->next =NULL;size = 0;}
private:node* dummy;int size;
}
int main()
{link* test = new link();link test2;
}

上面创建的test和test2都是使用我创建的构造函数。但是在执行完构造函数后，dummy居然是NULL，size(忘了)。等我学了Valgrind。再来看这个问题

刷题报告

class node {public:int val;node* next;node(int VAL) {this->val = VAL;next = NULL;}
};
class MyLinkedList {public:/** Initialize your data structure here. */MyLinkedList() {head = NULL;size = 0;}/** Get the value of the index-th node in the linked list. If the index is invalid, return -1. */int get(int index) {if (index >= size)return -1;node* walk=head;while (index-- > 0)walk = walk->next;return walk->val;}/** Add a node of value val before the first element of the linked list. After the insertion, the new node will be the first node of the linked list. */void addAtHead(int val) {node* NewNode = new node(val);NewNode->next = head;head = NewNode;size++;}/** Append a node of value val to the last element of the linked list. */void addAtTail(int val) {return addAtIndex(size, val);/*  node* NewNode = new node(val);if (size == 0)return addAtHead(val);else {node* walk=head;for (int i = 1; i < size; i++)walk = walk->next;walk->next = NewNode;size++;}*/}/** Add a node of value val before the index-th node in the linked list. If index equals to the length of linked list, the node will be appended to the end of linked list. If index is greater than the length, the node will not be inserted. */void addAtIndex(int index, int val) {if (index == 0)return addAtHead(val);else if (index > size)return;else {node* NewNode = new node(val);node* walk = head;for (int i = 1; i < index; i++)walk = walk->next;NewNode->next = walk->next;walk->next = NewNode;size++;}}/** Delete the index-th node in the linked list, if the index is valid. */void deleteAtIndex(int index) {if (index >= size)return;else if (index == 0) {node* dele = head;head = head->next;delete dele;}else {node* walk = head;while (index-- > 1)walk = walk->next;node* dele = walk->next;walk->next = dele->next;delete dele;}size--;}
private:node* head;int size;
};

LeetCode 707. Design Linked List相关推荐

LeetCode 92. Reverse Linked List II--Python 解法--反转部分链表--笔试算法题
题目地址:Reverse Linked List II - LeetCode Reverse a linked list from position m to n. Do it in one-pass ...
leetcode 622. Design Circular Queue | 641. 设计循环双端队列（Java）
题目 https://leetcode.com/problems/design-circular-deque/ 题解相关问题:leetcode 622. Design Circular Queue ...
【回文串7】LeetCode 234. Palindrome Linked List
LeetCode 234. Palindrome Linked List Solution1:我的答案一遍过,哈哈哈! /*** Definition for singly-linked list. ...
【??链表】LeetCode 92. Reverse Linked List II
LeetCode 92. Reverse Linked List II Solution1: 参考网址:http://www.cnblogs.com/grandyang/p/4306611.html ...
【手绘漫画】面试必考之手撕双链表（解题模板和深度剖析），（LeetCode 707）
文章目录图解算法与数据结构 1.前言 2.代码 3.正文 4.实例图解算法与数据结构 1.前言今天开始链表,这一讲是单链表,下一讲是双链表. 下面一起来看看吧!!! 2.代码模板: //C++ ...
C#LeetCode刷题之#707-设计链表（Design Linked List）
问题该文章的最新版本已迁移至个人博客[比特飞],单击链接 https://www.byteflying.com/archives/4118 访问. 设计链表的实现.您可以选择使用单链表或双链表.单链 ...
LeetCode 206 Reverse Linked List--反转链表--迭代与递归解法--递归使用一个临时变量，迭代使用3个
此题链接:Reverse Linked List - LeetCode Reverse a singly linked list. Example: Input: 1->2->3-> ...
LeetCode 707. 设计链表（List）
文章目录 1. 设计一个单链表 2. 双向链表 1. 设计一个单链表在链表类中实现这些功能: get(index):获取链表中第 index 个节点的值.如果索引无效,则返回-1. addAtHea ...
leetcode 203. Remove Linked List Elements(链表)
Remove all elements from a linked list of integers that have value val. Example Given: 1 --> 2 -- ...
[LeetCode] 234. Palindrome Linked List 回文链表
Given a singly linked list, determine if it is a palindrome. Example 1: Input: 1->2 Output: false ...

LeetCode 707. Design Linked List

707. Design Linked List

二刷

卡壳？

刷题报告

LeetCode 707. Design Linked List相关推荐

最新文章

热门文章