leetcode-zwischenzug
Advanced tools
31
index.js
@@ -13,2 +13,4 @@ const assert = require('assert') | ||
// TODO: ListNode utils | ||
function ListNode(val) { | ||
@@ -127,9 +129,31 @@ this.val = val | ||
} catch (_e) { | ||
console.error(`${prefix}[FAILED] expected: ${expected}, actual: ${actual}`) | ||
console.error(`${prefix}[FAILED]`) | ||
console.error('expected:') | ||
console.error(expected) | ||
console.error('actual:') | ||
console.error(actual) | ||
} | ||
} else { | ||
console.log(`${prefix}result: ${actual}`) | ||
console.log(`${prefix}result:`) | ||
console.log(actual) | ||
} | ||
} | ||
const mkListNode = xs => { | ||
const pre = {next: null} | ||
let cur = pre | ||
for (let i = 0; i < xs.length; ++i) { | ||
cur.next = new ListNode(xs[i]) | ||
cur = cur.next | ||
} | ||
return pre.next | ||
} | ||
const listNodeToArray = l => { | ||
const ret = [] | ||
for (let cur = l; cur; cur = cur.next) | ||
ret.push(cur.val) | ||
return ret | ||
} | ||
/* | ||
@@ -180,2 +204,5 @@ shorthand for list generation instead of the super verbose randomIntGenBetween. | ||
Interval, | ||
ListNode, | ||
mkListNode, | ||
listNodeToArray, | ||
@@ -182,0 +209,0 @@ mkTree, |
{ | ||
"name": "leetcode-zwischenzug", | ||
"version": "0.2.1", | ||
"version": "0.3.0", | ||
"description": "testing & debugging utilities for LeetCode", | ||
@@ -5,0 +5,0 @@ "main": "index.js", |
6495
8%182
15.19%