PriorityQueue | /mod.ts | masx200_leetcode_test@7.6.0

x/masx200_leetcode_test/mod.ts>PriorityQueue

leetcode测试

0on3uN 1-bit-and-2-bit-characters 132-pattern 1fGaJU 3sum 3u1WK4 4ueAj6 7WHec2 FortPu H8086Q IDBivT JEj789 JFETK5 Jf1JuT LGjMqU N6YdxV NYBBNL OrIXps P5rCT8 aMhZSa add-binary add-strings add-to-array-form-of-integer add-two-integers add-two-numbers add-two-numbers-ii alien-dictionary all-ancestors-of-a-node-in-a-directed-acyclic-graph all-elements-in-two-binary-search-trees all-oone-data-structure apply-discount-to-prices average-of-levels-in-binary-tree bLyHh0 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-zigzag-level-order-traversal binode-lcci boats-to-save-people bracket-lcci build-array-from-permutation c32eOV calculator-lcci cells-in-a-range-on-an-excel-sheet cells-with-odd-values-in-a-matrix 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 climbing-stairs clone-graph clone-n-ary-tree clumsy-factorial combinations complete-binary-tree-inserter complex-number-multiplication concatenation-of-array cong-wei-dao-tou-da-yin-lian-biao-lcof consecutive-numbers-sum 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-asterisks count-number-of-pairs-with-absolute-difference-k count-servers-that-communicate counting-bits cousins-in-binary-tree daily-temperatures decode-string decode-the-message decode-xored-array decompress-run-length-encoded-list 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-number-container-system design-a-text-editor design-add-and-search-words-data-structure design-an-atm-machine design-an-ordered-stream design-browser-history design-circular-deque design-circular-queue design-hashmap design-hashset design-linked-list design-parking-system design-skiplist design-twitter determine-color-of-a-chessboard-square diagonal-traverse 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 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-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 fan-zhuan-lian-biao-lcof fei-bo-na-qi-shu-lie-lcof fibonacci-number 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-elements-in-a-contaminated-binary-tree find-largest-value-in-each-tree-row find-median-from-data-stream find-peak-element find-players-with-zero-or-one-losses find-the-difference find-the-duplicate-number find-the-winner-of-the-circular-game first-bad-version 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 goat-latin gray-code guess-numbers h54YBf hPov7L hamming-distance hanota-lcci happy-number he-bing-liang-ge-pai-xu-de-lian-biao-lcof html-entity-parser iIQa4I implement-queue-using-stacks 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-into-a-sorted-circular-linked-list insertion-sort-list integer-break integer-to-roman intersection-of-two-linked-lists intersection-of-two-linked-lists-lcci invert-binary-tree is-graph-bipartite island-perimeter jBjn9C jJ0w9p jewels-and-stones ju-zhen-zhong-de-lu-jing-lcof 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-triangle-area last-stone-weight length-of-last-word lexicographical-numbers lfu-cache lian-biao-zhong-dao-shu-di-kge-jie-dian-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-word-in-dictionary lru-cache lru-cache-lcci majority-element making-a-large-island map-sum-pairs matchsticks-to-square max-area-of-island max-consecutive-ones max-increase-to-keep-city-skyline max-points-on-a-line maximum-ascending-subarray-sum maximum-depth-of-binary-tree maximum-depth-of-n-ary-tree maximum-level-sum-of-a-binary-tree maximum-nesting-depth-of-the-parentheses maximum-number-of-groups-entering-a-competition maximum-number-of-vowels-in-a-substring-of-given-length maximum-number-of-words-found-in-sentences maximum-subarray maximum-twin-sum-of-a-linked-list maximum-width-of-binary-tree mean-of-array-after-removing-some-elements median-of-two-sorted-arrays merge-in-between-linked-lists merge-intervals merge-k-sorted-lists merge-nodes-in-between-zeros merge-sorted-array merge-two-binary-trees merge-two-sorted-lists middle-of-the-linked-list min-stack mini-parser minimum-absolute-difference minimum-absolute-difference-in-bst minimum-distance-between-bst-nodes minimum-index-sum-of-two-lists minimum-moves-to-equal-array-elements-ii minimum-number-of-operations-to-move-all-balls-to-each-box minimum-number-of-refueling-stops minimum-operations-to-make-the-array-increasing minimum-size-subarray-sum minimum-sum-of-four-digit-number-after-splitting-digits most-frequent-subtree-sum most-stones-removed-with-same-row-or-column move-zeroes moving-average-from-data-stream multiply-strings my-calendar-i my-calendar-ii my-calendar-iii n-ary-tree-level-order-traversal n-ary-tree-postorder-traversal n-ary-tree-preorder-traversal n-queens n-repeated-element-in-size-2n-array n-th-tribonacci-number next-greater-element-i next-greater-element-iii next-permutation number-of-1-bits number-of-different-integers-in-a-string number-of-islands number-of-provinces number-of-recent-calls o8SXZn odd-even-linked-list one-away-lcci ones-and-zeroes opLdQZ orderly-queue p0NxJO pacific-atlantic-water-flow

mod.ts (default module)

Fraction

GraphNode

ListNode

MultilevelDoublyLinkedListNode

binary_count_one_bigint

buildBST

calculateStraightLineEquation

climbing_stairs_bigint

cos

dot

get_deep_next_of_list

get_end_of_list

get_length_of_list

greatest_common_divisor

PrefixTreeSearchPrefix

PrefixTreeSearchPrefixEach

PrefixTreeStartsWith

PrefixTreeToArray

rand7

searchSegmentChildren

sum

TrieNodeCountWordsEqualTo

TrieNodeCountWordsStartingWith

TrieNodeErase

TrieNodeInsert

uniqueStraightLineEquation

interface PriorityQueue

Re-export

import { type PriorityQueue } from "https://deno.land/x/masx200_leetcode_test@7.6.0/mod.ts";

Properties

clear: () => void

clear all elements

length: () => number

get length of elements

comparator: (a: T, b: T) => number

comparator Function used to determine the order of the elements. It is expected to return a negative value if the head argument is less than the second argument, zero if they're equal, and a positive value otherwise.

offer: (value: T) => void

add one element

head: () => T | undefined

get min element

tail: () => T | undefined

get max element

pop: () => T | undefined

get and delete max element

shift: () => T | undefined

get and delete min element

Methods

at(index: number): T | undefined

isEmpty(): boolean

toArray(): T[]

function PriorityQueue

Re-export

import { PriorityQueue } from "https://deno.land/x/masx200_leetcode_test@7.6.0/mod.ts";

PriorityQueue<T = any>(comparator: (a: T, b: T) => number, values?: T[]): PriorityQueue<T>

Type Parameters

optional

T = any

Parameters

comparator: (a: T, b: T) => number

optional

values: T[]

Returns

PriorityQueue<T>