摘要: dg-publish: true study/datastructure A Heap is a complete binary tree, where all levels of tree, except Possibly the last level, are fully filled ![[P 阅读全文
posted @ 2023-10-24 10:23 HardisonDream 阅读(60) 评论(0) 推荐(0)
摘要: 学习/csharp 学习/csharp Day 1 ; Day 2: 1. Solution: FirstProject 2. Project: FirstProject 3. C# file: FirstProject 4. Class: FirstProject 5. Class member: 阅读全文
posted @ 2023-10-24 10:18 HardisonDream 阅读(36) 评论(0) 推荐(0)
摘要: study/java Design a class to find the kth largest element in a stream. Note that it is the kth largest element in the sorted order, not the kth distin 阅读全文
posted @ 2023-10-24 10:16 HardisonDream 阅读(9) 评论(0) 推荐(0)
摘要: study/java #neetcode Valid Sudoku List<Integer> list=new ArrayList<>(); Set seen = new HashSet(); board[i][j] != '.' or board[i][j] != "." In Java, yo 阅读全文
posted @ 2023-10-24 10:16 HardisonDream 阅读(5) 评论(0) 推荐(0)
摘要: 学习/java 1. 对象 Object (Is a/Is like) a. 向上转型 upcasting (解耦) i. 圆形也是一种形状 b. 向下转型 i. 参数化类型机制(Parameterized Type Mechanism) c. 多态(Polymorphism)--动态绑定实现多态性 阅读全文
posted @ 2023-08-08 17:05 HardisonDream 阅读(10) 评论(0) 推荐(0)