/deps.ts | masx200_leetcode_test@10.1.0

leetcode测试

0on3uN 1-bit-and-2-bit-characters 132-pattern 1fGaJU 1nzheng-shu-zhong-1chu-xian-de-ci-shu-lcof 3sum 3u1WK4 4sum 4ueAj6 7WHec2 FortPu H8086Q IDBivT JEj789 JFETK5 Jf1JuT LGjMqU aMhZSa add-binary add-one-row-to-tree add-strings add-to-array-form-of-integer add-two-integers add-two-numbers add-two-numbers-ii add-without-plus-lcci alien-dictionary all-ancestors-of-a-node-in-a-directed-acyclic-graph all-elements-in-two-binary-search-trees all-oone-data-structure angle-between-hands-of-a-clock apply-discount-to-prices average-of-levels-in-binary-tree bLyHh0 ba-shu-zi-fan-yi-cheng-zi-fu-chuan-lcof ba-shu-zu-pai-cheng-zui-xiao-de-shu-lcof ba-zi-fu-chuan-zhuan-huan-cheng-zheng-shu-lcof balanced-binary-tree bao-han-minhan-shu-de-zhan-lcof basic-calculator basic-calculator-ii beautiful-arrangement best-time-to-buy-and-sell-stock biao-shi-shu-zhi-de-zi-fu-chuan-lcof binary-gap binary-search binary-search-tree-iterator binary-search-tree-to-greater-sum-tree binary-tree-inorder-traversal binary-tree-level-order-traversal binary-tree-level-order-traversal-ii binary-tree-postorder-traversal binary-tree-preorder-traversal binary-tree-pruning binary-tree-zigzag-level-order-traversal binode-lcci boats-to-save-people bracket-lcci broken-calculator bu-yong-jia-jian-cheng-chu-zuo-jia-fa-lcof build-array-from-permutation c32eOV calculator-lcci cells-in-a-range-on-an-excel-sheet cells-with-odd-values-in-a-matrix check-completeness-of-a-binary-tree check-if-a-word-occurs-as-a-prefix-of-any-word-in-a-sentence check-if-binary-string-has-at-most-one-segment-of-ones check-if-one-string-swap-can-make-strings-equal check-if-string-is-a-prefix-of-array chou-shu-lcof climbing-stairs clone-graph clone-n-ary-tree clumsy-factorial coin-change color-fill-lcci combination-sum combination-sum-ii combinations complete-binary-tree-inserter complex-number-multiplication concatenation-of-array cong-shang-dao-xia-da-yin-er-cha-shu-ii-lcof cong-shang-dao-xia-da-yin-er-cha-shu-iii-lcof cong-shang-dao-xia-da-yin-er-cha-shu-lcof cong-wei-dao-tou-da-yin-lian-biao-lcof consecutive-numbers-sum construct-binary-tree-from-preorder-and-inorder-traversal construct-string-from-binary-tree construct-the-rectangle container-with-most-water contains-duplicate contains-duplicate-ii convert-1d-array-into-2d-array convert-binary-number-in-a-linked-list-to-integer convert-binary-search-tree-to-sorted-doubly-linked-list convert-bst-to-greater-tree convert-sorted-array-to-binary-search-tree convert-sorted-list-to-binary-search-tree copy-list-with-random-pointer count-and-say count-asterisks count-complete-tree-nodes count-number-of-bad-pairs count-number-of-pairs-with-absolute-difference-k count-servers-that-communicate count-unique-characters-of-all-substrings-of-a-given-string counting-bits counting-words-with-a-given-prefix cousins-in-binary-tree create-target-array-in-the-given-order cuyjEf da-yin-cong-1dao-zui-da-de-nwei-shu-lcof daily-temperatures decode-string decode-the-message decode-ways decode-xored-array decompress-run-length-encoded-list deepest-leaves-sum defanging-an-ip-address delete-middle-node-lcci delete-node-in-a-bst delete-node-in-a-linked-list delete-the-middle-node-of-a-linked-list design-a-food-rating-system design-a-number-container-system design-a-stack-with-increment-operation design-a-text-editor design-add-and-search-words-data-structure design-an-atm-machine design-an-ordered-stream design-authentication-manager design-bitset design-browser-history design-circular-deque design-circular-queue design-front-middle-back-queue design-hashmap design-hashset design-linked-list design-parking-system design-skiplist design-twitter determine-color-of-a-chessboard-square detonate-the-maximum-bombs di-yi-ge-zhi-chu-xian-yi-ci-de-zi-fu-lcof diagonal-traverse diagonal-traverse-ii diao-zheng-shu-zu-shun-xu-shi-qi-shu-wei-yu-ou-shu-qian-mian-lcof different-ways-to-add-parentheses display-table-of-food-orders-in-a-restaurant distance-between-bus-stops distribute-candies divide-two-integers dui-cheng-de-er-cha-shu-lcof dui-lie-de-zui-da-zhi-lcof duplicate-zeros eight-queens-lcci encode-and-decode-tinyurl encode-n-ary-tree-to-binary-tree encrypt-and-decrypt-strings er-cha-shu-de-jing-xiang-lcof er-cha-shu-de-shen-du-lcof er-cha-shu-de-zui-jin-gong-gong-zu-xian-lcof er-cha-shu-zhong-he-wei-mou-yi-zhi-de-lu-jing-lcof er-cha-sou-suo-shu-de-zui-jin-gong-gong-zu-xian-lcof er-cha-sou-suo-shu-yu-shuang-xiang-lian-biao-lcof er-jin-zhi-zhong-1de-ge-shu-lcof er-wei-shu-zu-zhong-de-cha-zhao-lcof evaluate-boolean-binary-tree evaluate-reverse-polish-notation exchange-lcci exclusive-time-of-functions factorial-trailing-zeroes fan-zhuan-dan-ci-shun-xu-lcof fan-zhuan-lian-biao-lcof fei-bo-na-qi-shu-lie-lcof fi9suh fibonacci-number final-prices-with-a-special-discount-in-a-shop final-value-of-variable-after-performing-operations find-a-value-of-a-mysterious-function-closest-to-target find-all-numbers-disappeared-in-an-array find-and-replace-pattern find-bottom-left-tree-value find-center-of-star-graph find-closest-lcci find-duplicate-subtrees find-elements-in-a-contaminated-binary-tree find-if-path-exists-in-graph find-k-closest-elements find-largest-value-in-each-tree-row find-median-from-data-stream find-minimum-in-rotated-sorted-array-ii find-peak-element find-players-with-zero-or-one-losses find-smallest-letter-greater-than-target find-the-difference find-the-duplicate-number find-the-winner-of-the-circular-game first-bad-version first-common-ancestor-lcci first-letter-to-appear-twice first-missing-positive fizz-buzz flatten-a-multilevel-doubly-linked-list flatten-binary-tree-to-linked-list flatten-nested-list-iterator flip-string-to-monotone-increasing flood-fill fraction-addition-and-subtraction fraction-to-recurring-decimal fu-za-lian-biao-de-fu-zhi-lcof g5c51o generate-a-string-with-characters-that-have-odd-counts generate-parentheses generate-random-point-in-a-circle get-kth-magic-number-lcci goal-parser-interpretation goat-latin gou-jian-cheng-ji-shu-zu-lcof gray-code group-anagrams group-the-people-given-the-group-size-they-belong-to gu-piao-de-zui-da-li-run-lcof guess-numbers h54YBf hPov7L hamming-distance hanota-lcci happy-number he-bing-liang-ge-pai-xu-de-lian-biao-lcof he-wei-sde-liang-ge-shu-zi-lcof html-entity-parser hua-dong-chuang-kou-de-zui-da-zhi-lcof iIQa4I implement-queue-using-stacks implement-queue-using-stacks-lcci implement-rand10-using-rand7 implement-stack-using-queues implement-strstr implement-trie-ii-prefix-tree implement-trie-prefix-tree increasing-order-search-tree inorder-successor-in-bst insert-delete-getrandom-o1 insert-delete-getrandom-o1-duplicates-allowed insert-interval insert-into-a-sorted-circular-linked-list insertion-sort-list integer-break integer-to-roman intersection-of-two-arrays intersection-of-two-linked-lists intersection-of-two-linked-lists-lcci invert-binary-tree is-graph-bipartite island-perimeter iterator-for-combination jBjn9C jJ0w9p jewels-and-stones jian-sheng-zi-ii-lcof jian-sheng-zi-lcof ju-zhen-zhong-de-lu-jing-lcof k-closest-points-to-origin kTOapQ kids-with-the-greatest-number-of-candies koko-eating-bananas kth-largest-element-in-a-stream kth-largest-element-in-an-array kth-node-from-end-of-list-lcci kth-smallest-element-in-a-bst largest-component-size-by-common-factor largest-number largest-triangle-area last-stone-weight length-of-last-word lexicographical-numbers lfu-cache lian-biao-zhong-dao-shu-di-kge-jie-dian-lcof lian-xu-zi-shu-zu-de-zui-da-he-lcof liang-ge-lian-biao-de-di-yi-ge-gong-gong-jie-dian-lcof linked-list-cycle linked-list-cycle-ii linked-list-cycle-lcci linked-list-random-node list-of-depth-lcci long-pressed-name longest-absolute-file-path longest-common-prefix longest-palindromic-substring longest-substring-without-repeating-characters longest-uncommon-subsequence-ii longest-univalue-path longest-word-in-dictionary lowest-common-ancestor-of-a-binary-search-tree lowest-common-ancestor-of-a-binary-tree

mod.ts (default module)

Fraction

GraphNode

ListNode

MultilevelDoublyLinkedListNode

ArrayToCircularDoublyTreeList

ArrayToCircularLinkedList

ArrayToListNode

bigint_max

bigint_min

binary_count_one_bigint

buildBST

cache

calculateStraightLineEquation

climbing_stairs_bigint

cos

dot

get_deep_next_of_list

get_end_of_list

get_length_of_list

getVariable

greatest_common_divisor

PrefixTreeSearchPrefix

PrefixTreeSearchPrefixEach

PrefixTreeStartsWith

PrefixTreeToArray

rand7

searchSegmentChildren

sum

TreeNodeLeetCodeFromJSON

TreeNodeLeetCodeParse

TreeNodeLeetCodeStringify

TreeNodeLeetCodeToJSON

TrieNodeCountWordsEqualTo

TrieNodeCountWordsStartingWith

TrieNodeErase

TrieNodeInsert

uniqueStraightLineEquation

import * as masx200LeetcodeTest from "https://deno.land/x/masx200_leetcode_test@10.1.0/deps.ts";

Classes

c BinarySearchTree
c BinarySearchTreeNode
c Heap

Functions

f assert	Make an assertion, error will be thrown if `expr` does not have truthy value.
f assertAlmostEquals	Make an assertion that `actual` and `expected` are almost equal numbers through a given tolerance. It can be used to take into account IEEE-754 double-precision floating-point representation limitations. If the values are not almost equal then throw.
f assertEquals	Make an assertion that `actual` and `expected` are equal, deeply. If not deeply equal, then throw.
f assertFalse
f assertStrictEquals	Make an assertion that `actual` and `expected` are strictly equal. If not then throw.
f combinations	Yields `r` length `Arrays` from the input `iterable`. Order of selection does not matter and elements are chosen without replacement.
f equal	Deep equality comparison used in assertions
f isIP
f parse	Take a set of command line arguments, optionally with a set of options, and return an object representing the flags found in the passed arguments.
f walk	Walks the file tree rooted at root, yielding each file or directory in the tree filtered according to the given options. The files are walked in lexical order, which makes the output deterministic but means that for very large directories walk() can be inefficient.