组队复习算法+刷题

chenghsu0224 发表于 2019-8-10 01:55
8.9 晚上打卡
88. Merge Sorted Array => start from the end and do it in-place
31. Next permutatio ...

厉害了 好刻苦 今天打卡了两次 👍👍

kaka880213 发表于 2019-8-9 13:09
208.implement-trie-prefix-tree.java --> 终于学会了Trie
224.basic-calculator.java --> sign 1 / -1
...

👍我还不知道trie 和tree map😂 我先把我的基础打好 一点点来 加油加油

我也要开始打卡了！！
楼主要不我们每次打卡就互相给点大米如何？

GehMvr 发表于 2019-8-10 08:18
我也要开始打卡了！！
楼主要不我们每次打卡就互相给点大米如何？

欢迎欢迎 可以啊 怎么互相给大米？

qugemingzi 发表于 2019-8-10 10:39
欢迎欢迎 可以啊 怎么互相给大米？

这个板块的帖子好像没法评分

8/9
269.alien-dictionary.java --> topology sort （新学到的算法和DAG这个数据结构）
811.subdomain-visit-count.java -->凑数题

打卡3:
Tree:
99. Recover Binary Search Tree
230. Kth Smallest Element in a BST

打卡
leetcode 66

8.10打卡：
340. Longest Substring with At Most K Distinct Characters => Sliding Window: map<char, lastIdx>, when map.size() > k, remove char with min lastIdx
98. Validate Binary Search Tree => recursion: lower and upper bound
621. Task Scheduler => no. of intervals = no. of tasks + no. of idles (depends on task with max frequency)
125. Valid Palindrome => two pointers
158. Read N Characters Given Read4 II - Call multiple times => use pointers and temp buffer to record the reading pregress
133. Clone Graph => similar with copy list with random pointer but use recursion: map<original node, cloned node>
348. Design Tic-Tac-Toe => rows[], cols[], diagonal and anti-diagonal to check if a player wins
199. Binary Tree Right Side View => Recursion: maintain currDepth to check if any node is added at current level

好厉害， 希望自己也开始努力