LeetCode-Class

This project is convenient for you to debug LeetCode

includes ListNode, TreeNode, Interval, Employee

ListNode

$3

``js
const node = new ListNode(val);
`

$3

(Follow LeetCode topic specifications): ListNode.create(arr : Array) : ListNode

`js
const head = ListNode.create([1, 2, 3, 4, 5]);
`

$3

ListNode.prototype.visualShow() : void

`js
const head = ListNode.create([1, 2, 3, 4, 5]);

head.visualShow();
//1 -> 2 -> 3 -> 4 -> 5
`

$3

(Follow LeetCode topic specifications, Example Question 160): ListNode.createIntersectList(firstArr: Array,secondArr: ArrayIntersectArr: Array) : [ListNode, ListNode], parameters are: first ListArray Uncrossed, second ListArray Uncrossed, crossed

`js
const [head1, head2] = ListNode.createIntersectList([1, 2], [3, 4], [5, 6]);
`

$3

ListNode.prototype.show() : Array

`js
const head = ListNode.create([1, 2, 3]);

head.show();
// [1,2,3]
ListNode.show(head);
// [1,2,3]
`

$3

ListNode.prototype.getLast() : ListNode

`js
const head = ListNode.create([1, 2, 3]);

head.getLast().show();
// [3]
`

$3

ListNode.mock(n : Number) : ListNode

`js
const head = ListNode.mock(5);
`

Interval

$3

Interval

`js
const interval = new Interval(1, 3);
`

$3

(Follow LeetCode topic specifications): Interval.createList(arr : Array[]) : Interval[]

`js
const intervals = Interval.createList([
[1, 2],
[3, 4],
]);
`

$3

Interval.show() : Array

`js
const interval = new Interval(1, 3);

interval.show();
// [1,3]
Interval.show(interval);
// [1,3]
`

Transform Intervals to arrays: Interval.showList() : Array[]

`js
const intervals = Interval.createList([
[1, 2],
[3, 4],
]);

Interval.showList(intervals);
// [[1,2],[3,4]]
`

Employee

$3

Employee

`js
const employee = new Employee(1);
`

(Follow LeetCode topic specifications): Employee.createArr(arr: [number, number, number[]][]) : Employee[]

TreeNode

$3

TreeNode

`js
const node = new TreeNode(5);
`

$3

(Follow LeetCode topic specifications): TreeNode.create(arr : Array) : TreeNode

> P.S. LeetCode title specification is From top to bottom, from left to right, indispensable position fill withnull

`js
const head = TreeNode.create([1, 2, 3, null, 4, null, null, 5, 6]);
`

$3

TreeNode.prototype.show() : Array

`js
const head = TreeNode.create([1, 2, 3, null, 4, null, null, 5, 6]);

head.show();
// [1,2,3,null,4,null,null,5,6]
TreeNode.show(head);
// [1,2,3,null,4,null,null,5,6]
`

$3

TreeNode.prototype.visualShow() : void

`js
const head = TreeNode.create([1, 2, 3, null, 4, null, null, 5, 6]);

head.visualShow();
// 1 -> 2
// ↘→ 4 -> 5
// ↘→ 6
// ↘→ 3
`

Heap

$3

Heap

`js
const heap = new Heap([2, 1, 0, 3, 4], null, false);
`

The first argument is inital array
The second argument is how to get number from the element, default is null(get the value)
For example:

`js
const heap = new Heap(
[
{ val: 2, name: "b" },
{ val: 1, name: "a" },
],
(element) => element.val,
false
);
`

The third parameter indicates whether it is the maximum heap, default is minimum heap

$3

Heap.prototype.add(element: T): number

`js
heap.add(5);
`

$3

Heap.prototype.delete() : T

`js
head.delete();
`

$3

Heap.prototype.value[0]

`js
head.value[0];
`

RunScript(For Constructor)

> For Question 1172, Dinner Plate Stacks. issue is need For this is Test

$3

Execute input parameters in a certain order
function runScript(ommonds: String[], inputs: any[][], classes?: any[]): any[]

`js
// The parameters from left to right are
// commonds : List of executed commands
// inputs : Corresponding execution parameters
// classes : Corresponding execution class array
runScript(
[
"DinnerPlates",
"push",
"push",
"push",
"push",
"push",
"popAtStack",
"push",
"push",
"popAtStack",
"popAtStack",
"pop",
"pop",
"pop",
"pop",
"pop",
],
[
[2],
[1],
[2],
[3],
[4],
[5],
[0],
[20],
[21],
[0],
[2],
[],
[],
[],
[],
[],
],
[DinnerPlates]
);

// see example
`

$3

please use nodejs assert` to confirm the result is right.