problemscpp
A collection of my answers to algorithm problems in c++.
| 函数
leetcode::design_linked_list 命名空间参考

  1. Design Linked List
更多...

class  MyLinkedList
 

函数

 TEST (design_linked_list, case1)
 

详细描述

  1. Design Linked List

函数说明

◆ TEST()

leetcode::design_linked_list::TEST ( design_linked_list  ,
case1   
)

在文件 leetcode_test.cpp3440 行定义.

3440 {
3441 MyLinkedList mll;
3442 mll.addAtHead(1);
3443 mll.addAtTail(3);
3444 mll.addAtIndex(1, 2);
3445 ASSERT_EQ(2, mll.get(1));
3446 mll.deleteAtIndex(1);
3447 ASSERT_EQ(3, mll.get(1));
3448 }
int get(int index) const
Get the value of the indexth node in the linked list. If the index is invalid, return -1.
Definition: leetcode.cpp:7328
void deleteAtIndex(int index)
Delete the indexth node in the linked list, if the index is valid.
Definition: leetcode.cpp:7376
void addAtHead(int val)
Add a node of value val before the first element of the linked list. After the insertion,...
Definition: leetcode.cpp:7340
void addAtTail(int val)
Append a node of value val as the last element of the linked list.
Definition: leetcode.cpp:7349
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...
Definition: leetcode.cpp:7355

引用了 leetcode::design_linked_list::MyLinkedList::addAtHead(), leetcode::design_linked_list::MyLinkedList::addAtIndex(), leetcode::design_linked_list::MyLinkedList::addAtTail(), leetcode::design_linked_list::MyLinkedList::deleteAtIndex() , 以及 leetcode::design_linked_list::MyLinkedList::get().