LeetCode Solutions: A Record of My Problem Solving Journey.( leetcode题解,记录自己的leetcode解题之路。)
-
Updated
Aug 19, 2020 - JavaScript
{{ message }}
LeetCode Solutions: A Record of My Problem Solving Journey.( leetcode题解,记录自己的leetcode解题之路。)
Minimal examples of data structures and algorithms in Python
GoDS (Go Data Structures). Containers (Sets, Lists, Stacks, Maps, Trees), Sets (HashSet, TreeSet, LinkedHashSet), Lists (ArrayList, SinglyLinkedList, DoublyLinkedList), Stacks (LinkedListStack, ArrayStack), Maps (HashMap, TreeMap, HashBidiMap, TreeBidiMap, LinkedHashMap), Trees (RedBlackTree, AVLTree, BTree, BinaryHeap), Comparators, Iterators, Enumerables, Sort, JSON
A new way to see and navigate directory trees : https://dystroy.org/broot
180+ Algorithm & Data Structure Problems using C++
the champagne of beta embedded databases
An Open-Source Collection of +200 Algorithmic Flash Cards to Help you Preparing your Algorithm & Data Structure Interview
Computer science reimplemented in JavaScript
JavaScript tree view / tree grid plugin with support for keyboard, inline editing, filtering, checkboxes, drag'n'drop, and lazy loading
I think it would be nice to have the option to dump a raw graphviz DOT file instead of the sppf.png for a few reasons:
Any though
The Most Complete React UI Component Library
A minimal but extreme fast B+ tree indexing structure demo for billions of key-value storage
A complete, fully tested and documented data structure library written in pure JavaScript.
A simple yet powerful tree component for Angular (>=2)
Open source content from a book in progress, Hands-on Algorithmic Problem Solving
Tree widget for jQuery
Android and iOS charts based on react-native-svg and paths-js
Add a description, image, and links to the tree topic page so that developers can more easily learn about it.
To associate your repository with the tree topic, visit your repo's landing page and select "manage topics."
steps to reproduce
Write a loop, from 1 to 80000, each time add a random int to the max heap.
In theory it takes very little time(NlogN, N=80000, <1sec ), but the program does take a long time.
I'v also tested the BinaryHeap in https://github.com/SolutionsDesign/Algorithmia, it performs well, so it is probably due to the bad algorithm.