issues Search Results · repo:liuyubobobo/Play-with-Data-Structures language:Java
Filter by
13 results
(92 ms)13 results
inliuyubobobo/Play-with-Data-Structures (press backspace or delete to remove)老师您好，我对这里AVL树的LL和RR的判断产生了一些疑惑
// 向以node为根的二分搜索树中插入元素(key, value)，递归算法
// 返回插入新节点后二分搜索树的根
private Node add(Node node, K key, V value) {
if (node == null) {
size++;
return new Node(key, ...
Wonderchn
- Opened on May 24, 2021
- #16
https://github.com/liuyubobobo/Play-with-Data-Structures/blob/master/09-Segment-Tree/03-Building-Segment-Tree/src/SegmentTree.java#L20-L26
线段树 build 中的递归终止条件少一个 l r, 当构造函数传入空数组时会使 l r 导致无限递归. (虽然应该不会有传入空数组的情况, ...
dyq666
- Opened on Mar 24, 2020
- #14
https://github.com/liuyubobobo/Play-with-Data-Structures/blob/master/08-Heap-and-Priority-Queue/05-Heapify-and-Replace-in-Heap/src/MaxHeap.java#L13-L17
public MaxHeap(E[] arr){
data = new ...
- 1
- Opened on Mar 23, 2020
- #13
提一个小的修改意见 :) (不是太熟悉 Java, 就用 Python 说明我的修改意见了.)
动态数组中实际上修改 capacity 的地方只有构造函数和 resize, 因此在这两个方法中检查 capacity != 0 可能比在 remove 中清晰.
而且可以方便的扩展, capacity != 0 等价于最小容积是 1, 这个最小容积也可以调成 10.
class Array:
...
- 1
- Opened on Mar 12, 2020
- #12
emojihao文件：10-Trie/Optional-02-Trie-Delete/src/RandomizedSet_Trie.java 行数：121 行后 方法：#remove(String) 问题：应该缺少 stack.pop();
// 删除word, 返回是否删除成功
public boolean remove(String word){
Stack Node stack = new Stack ...
kerraway
- 1
- Opened on Feb 26, 2019
- #10
rubinus09-Segment-Tree/05-Segment-Tree-Problems-in-Leetcode/src/NumArray2.java
老师，此文件中的for循环中应该是 =吧？
RonaldZhao
- 1
- Opened on Dec 5, 2018
- #8
bobo老师您好！
最近将您《玩转数据结构》这门课又过了一遍，同时重新将您这门课上绝大部分内容用python实现了一遍（link），欢迎fork/pr或者link到您这门课的repo里，期待能让更多以python为主力语言的同学更好的学习您这门课。
谢谢您提供了这么高质量的算法课程，同时也期待您下一门课：）
zwang96-dl
- 5
- Opened on Nov 1, 2018
- #7
https://github.com/liuyubobobo/Play-with-Data-Structures/blob/6419bec9a30214f24a61c35fb3f7973574bce3b5/05-Recursion/Optional-01-Recursive-LinkedList/src/LinkedListR.java#L4
Resursion - Recursion
zchengi
- 3
- Opened on Aug 3, 2018
- #5
Learn how you can use GitHub Issues to plan and track your work.
Save views for sprints, backlogs, teams, or releases. Rank, sort, and filter issues to suit the occasion. The possibilities are endless.Learn more about GitHub IssuesProTip!
Press the /
key to activate the search input again and adjust your query.Learn how you can use GitHub Issues to plan and track your work.
Save views for sprints, backlogs, teams, or releases. Rank, sort, and filter issues to suit the occasion. The possibilities are endless.Learn more about GitHub IssuesProTip!
Press the /
key to activate the search input again and adjust your query.