leetcode::design_linked_list::MyLinkedList类 参考

#include <leetcode.h>

Public 成员函数
	MyLinkedList ()
	Initializes the MyLinkedList object. 更多...
void	addAtHead (int 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	addAtIndex (int index, int val)
	Add a node of value val before the indexth node in the linked list. If index equals the length of the linked list, the node will be appended to the end of the linked list. If index is greater than the length, the node will not be inserted. 更多...
void	addAtTail (int val)
	Append a node of value val as the last element of the linked list. 更多...
void	deleteAtIndex (int index)
	Delete the indexth node in the linked list, if the index is valid. 更多...
int	get (int index) const
	Get the value of the indexth node in the linked list. If the index is invalid, return -1. 更多...

Private 属性
ListNode *	head
ListNode *	tail

详细描述

在文件 leetcode.h 第 2694 行定义.

构造及析构函数说明

MyLinkedList()

leetcode::design_linked_list::MyLinkedList::MyLinkedList

(

)

Initializes the MyLinkedList object.

在文件 leetcode.cpp 第 7323 行定义.

                                   {
            head = new ListNode();
            tail = head;
        }

引用了 head , 以及 tail.

成员函数说明

addAtHead()

void leetcode::design_linked_list::MyLinkedList::addAtHead

(

int

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.

在文件 leetcode.cpp 第 7340 行定义.

                                            {
            auto *const node = new ListNode(val);
            node->next       = head->next;
            head->next       = node;
            if(tail == head) {
                tail = node;
            }
        }

引用了 head, leetcode::ListNode::next , 以及 tail.

被这些函数引用 leetcode::design_linked_list::TEST().

addAtIndex()

void leetcode::design_linked_list::MyLinkedList::addAtIndex	(	int	index,
		int	val
	)

Add a node of value val before the indexth node in the linked list. If index equals the length of the linked list, the node will be appended to the end of the linked list. If index is greater than the length, the node will not be inserted.

在文件 leetcode.cpp 第 7355 行定义.

                                                        {
            index += 1;
            if(index < 1) {
                return;
            }
            auto *const node  = new ListNode(val);
            ListNode *current = head;
            for(int i = 0; i < index - 1 && current != nullptr; i++) {
                current = current->next;
            }
            if(current == nullptr) {
                delete node;
                return;
            }
            node->next    = current->next;
            current->next = node;
            if(current == tail) {
                tail = node;
            }
        }

引用了 head, leetcode::ListNode::next , 以及 tail.

被这些函数引用 leetcode::design_linked_list::TEST().

addAtTail()

void leetcode::design_linked_list::MyLinkedList::addAtTail

(

int

val

)

Append a node of value val as the last element of the linked list.

在文件 leetcode.cpp 第 7349 行定义.

                                            {
            auto *const node = new ListNode(val);
            tail->next       = node;
            tail             = node;
        }

引用了 leetcode::ListNode::next , 以及 tail.

被这些函数引用 leetcode::design_linked_list::TEST().

deleteAtIndex()

void leetcode::design_linked_list::MyLinkedList::deleteAtIndex

(

int

index

)

Delete the indexth node in the linked list, if the index is valid.

在文件 leetcode.cpp 第 7376 行定义.

                                                  {
            index += 1;
            if(index < 1) {
                return;
            }
            ListNode *current = head;
            for(int i = 0; i < index - 1 && current != nullptr; i++) {
                current = current->next;
            }
            if(current == nullptr) {
                return;
            }
            const auto *const p = current->next;
            if(p == tail) {
                tail = current;
            }
            if(p != nullptr) {
                current->next = current->next->next;
                delete p;
            }
        }

引用了 head, leetcode::ListNode::next , 以及 tail.

被这些函数引用 leetcode::design_linked_list::TEST().

get()

int leetcode::design_linked_list::MyLinkedList::get

(

int

index

)

const

Get the value of the indexth node in the linked list. If the index is invalid, return -1.

在文件 leetcode.cpp 第 7328 行定义.

                                             {
            index += 1;
            if(index < 1) {
                return -1;
            }
            const ListNode *current = head;
            for(int i = 0; i < index && current != nullptr; i++) {
                current = current->next;
            }
            return current == nullptr ? -1 : current->val;
        }

引用了 head, leetcode::ListNode::next , 以及 leetcode::ListNode::val.

被这些函数引用 leetcode::design_linked_list::TEST().

类成员变量说明

head

ListNode* leetcode::design_linked_list::MyLinkedList::head

private

在文件 leetcode.h 第 2695 行定义.

被这些函数引用 MyLinkedList(), addAtHead(), addAtIndex(), deleteAtIndex() , 以及 get().

tail

ListNode* leetcode::design_linked_list::MyLinkedList::tail

private

在文件 leetcode.h 第 2696 行定义.

被这些函数引用 MyLinkedList(), addAtHead(), addAtIndex(), addAtTail() , 以及 deleteAtIndex().

---

该类的文档由以下文件生成:

• leetcode.h
• leetcode.cpp