Commit 398146b

authored

feat: add solutions to lc problem: No.0146 (doocs#3909)

No.0146.LRU Cache

1 parent a336f65 commit 398146bCopy full SHA for 398146b

File tree

+925

-610

lines changed

+925

-610

lines changed

Lines changed: 2 additions & 10 deletions

Original file line number	Diff line number	Diff line change
`@@ -232,11 +232,7 @@ func (h hp) Pop() any { a := h; v := a[len(a)-1]; *h = a[:len(a)-1];`
`232`	`232`
`233`	`233`	`function mergeKLists(lists: Array<ListNode \| null>): ListNode \| null {`
`234`	`234`	`const pq = new MinPriorityQueue({ priority: (node: ListNode) => node.val });`
`235`		`- for (const head of lists) {`
`236`		`- if (head) {`
`237`		`- pq.enqueue(head);`
`238`		`- }`
`239`		`- }`
	`235`	`+ lists.filter(head => head).forEach(head => pq.enqueue(head));`
`240`	`236`	`const dummy: ListNode = new ListNode();`
`241`	`237`	`let cur: ListNode = dummy;`
`242`	`238`	`while (!pq.isEmpty()) {`
`@@ -318,11 +314,7 @@ impl Solution {`
`318`	`314`	`*/`
`319`	`315`	`var mergeKLists = function (lists) {`
`320`	`316`	`const pq = new MinPriorityQueue({ priority: node => node.val });`
`321`		`- for (const head of lists) {`
`322`		`- if (head) {`
`323`		`- pq.enqueue(head);`
`324`		`- }`
`325`		`- }`
	`317`	`+ lists.filter(head => head).forEach(head => pq.enqueue(head));`
`326`	`318`	`const dummy = new ListNode();`
`327`	`319`	`let cur = dummy;`
`328`	`320`	`while (!pq.isEmpty()) {`

Lines changed: 2 additions & 10 deletions

Original file line number	Diff line number	Diff line change
`@@ -233,11 +233,7 @@ func (h hp) Pop() any { a := h; v := a[len(a)-1]; *h = a[:len(a)-1];`
`233`	`233`
`234`	`234`	`function mergeKLists(lists: Array<ListNode \| null>): ListNode \| null {`
`235`	`235`	`const pq = new MinPriorityQueue({ priority: (node: ListNode) => node.val });`
`236`		`- for (const head of lists) {`
`237`		`- if (head) {`
`238`		`- pq.enqueue(head);`
`239`		`- }`
`240`		`- }`
	`236`	`+ lists.filter(head => head).forEach(head => pq.enqueue(head));`
`241`	`237`	`const dummy: ListNode = new ListNode();`
`242`	`238`	`let cur: ListNode = dummy;`
`243`	`239`	`while (!pq.isEmpty()) {`
`@@ -319,11 +315,7 @@ impl Solution {`
`319`	`315`	`*/`
`320`	`316`	`var mergeKLists = function (lists) {`
`321`	`317`	`const pq = new MinPriorityQueue({ priority: node => node.val });`
`322`		`- for (const head of lists) {`
`323`		`- if (head) {`
`324`		`- pq.enqueue(head);`
`325`		`- }`
`326`		`- }`
	`318`	`+ lists.filter(head => head).forEach(head => pq.enqueue(head));`
`327`	`319`	`const dummy = new ListNode();`
`328`	`320`	`let cur = dummy;`
`329`	`321`	`while (!pq.isEmpty()) {`

Lines changed: 1 addition & 5 deletions

Original file line number	Diff line number	Diff line change
`@@ -11,11 +11,7 @@`
`11`	`11`	`*/`
`12`	`12`	`var mergeKLists = function (lists) {`
`13`	`13`	`const pq = new MinPriorityQueue({ priority: node => node.val });`
`14`		`- for (const head of lists) {`
`15`		`- if (head) {`
`16`		`- pq.enqueue(head);`
`17`		`- }`
`18`		`- }`
	`14`	`+ lists.filter(head => head).forEach(head => pq.enqueue(head));`
`19`	`15`	`const dummy = new ListNode();`
`20`	`16`	`let cur = dummy;`
`21`	`17`	`while (!pq.isEmpty()) {`

Lines changed: 1 addition & 5 deletions

Original file line number	Diff line number	Diff line change
`@@ -12,11 +12,7 @@`
`12`	`12`
`13`	`13`	`function mergeKLists(lists: Array<ListNode \| null>): ListNode \| null {`
`14`	`14`	`const pq = new MinPriorityQueue({ priority: (node: ListNode) => node.val });`
`15`		`- for (const head of lists) {`
`16`		`- if (head) {`
`17`		`- pq.enqueue(head);`
`18`		`- }`
`19`		`- }`
	`15`	`+ lists.filter(head => head).forEach(head => pq.enqueue(head));`
`20`	`16`	`const dummy: ListNode = new ListNode();`
`21`	`17`	`let cur: ListNode = dummy;`
`22`	`18`	`while (!pq.isEmpty()) {`

Comments

(0)