4957 Commits

Author SHA1 Message Date
a6ce79a98a Merge pull request #1357 from Mrxulovemingming/master
添加0704.二分查找 Kotlin版本
2022-06-11 09:06:12 +08:00
b37c3e0c10 Merge branch 'master' into master 2022-06-11 09:06:04 +08:00
0ffffe0dd7 Merge pull request #1355 from xiaofei-2020/dp43
添加(0718.最长重复子数组.md):增加typescript版本
2022-06-11 09:02:52 +08:00
8156c358a1 Merge pull request #1354 from wzqwtt/tree05
添加(104.二叉树的最大深度、111.二叉树的最小深度)Scala版本
2022-06-11 09:02:29 +08:00
770c2308e4 Merge pull request #1353 from wzqwtt/tree04
添加(515.在每个树行中找最大值、116.填充每个节点的下一个右侧节点指针、117.填充每个节点的下一个右侧节点指针II)Scala版本
2022-06-11 09:02:11 +08:00
2386694b5b 添加(0100.相同的树.md):增加typescript版本 2022-06-11 00:43:30 +08:00
192beffb66 添加(1382.将二叉搜索树变平衡.md):增加typescript版本 2022-06-10 23:38:32 +08:00
9a068272ce 添加(0129.求根到叶子节点数字之和.md):增加typescript版本 2022-06-10 22:46:32 +08:00
7ee790f4f5 0042 接雨水添加单调栈go解法 2022-06-10 22:34:11 +08:00
7fd311f47b 添加 0376.摆动序列.md Scala版本 2022-06-10 20:09:14 +08:00
18f29ef178 添加 0455.分发饼干.md Scala版本 2022-06-10 16:28:33 +08:00
ddcd31b2a7 添加(0844.比较含退格的字符串.md):增加typescript版本 2022-06-10 11:27:26 +08:00
af239cef80 Merge branch 'master' of github.com:youngyangyang04/leetcode-master 2022-06-10 11:02:53 +08:00
f5f5f5a2a5 Update 2022-06-10 11:02:44 +08:00
e4d638fcc6 Merge pull request #1352 from wzqwtt/tree03
添加(199.二叉树的右视图、637.二叉树的层平均值、429.N叉树的层序遍历)Scala版本
2022-06-10 09:37:52 +08:00
71865c1dfa Merge pull request #1351 from wzqwtt/tree02
添加(二叉树的统一迭代法、102.二叉树的层序遍历、107.二叉树的层次遍历II)Scala版本
2022-06-10 09:37:33 +08:00
edbb487355 Merge branch 'master' into tree02 2022-06-10 09:37:26 +08:00
da137a1c1c Merge pull request #1350 from xiaofei-2020/dp42
添加(0674.最长连续递增序列.md):增加typescript版本
2022-06-10 09:36:45 +08:00
d00168db73 Merge pull request #1349 from xiaofei-2020/dp41
添加(0300.最长上升子序列.md):增加typescript版本
2022-06-10 09:36:23 +08:00
1ef962fe45 Merge pull request #1348 from wzqwtt/tree01
添加(二叉树理论基础、二叉树的递归遍历、二叉树的迭代遍历)Scala版本
2022-06-10 09:35:51 +08:00
0bb5277ecd Merge pull request #1346 from areslk/areslk-patch-1
Update 0110.平衡二叉树.md
2022-06-10 09:35:29 +08:00
c85105cde0 Merge pull request #1345 from molonlu/patch-1
Update 0226.翻转二叉树.md -- 与该文其他go示例代码风格相一致
2022-06-10 09:35:03 +08:00
730f58bcce refactor: add golang solution to Intersection of Two Linked Lists LCCI 2022-06-09 23:24:30 +08:00
e06b53a88d 添加 0037.解数独.md Scala版本 2022-06-09 21:57:15 +08:00
0e41479c1b Merge pull request #1 from ExplosiveBattery/ExplosiveBattery-patch-0101
Update 0101.对称二叉树.md level order traversal
2022-06-09 02:36:06 +08:00
e354cd6e25 Update 0101.对称二叉树.md level order traversal
This leetcode problem can use level order traversal method, the difference between with the normal version is we should  judge for None.
There is my python answer, please feel free to contact with me if you have any problem.
2022-06-09 02:33:55 +08:00
cded6c5c80 Update 0110.平衡二叉树.md python code via iterate
In the original method, we need to traversal every node and write the function named getDepth to get the depth of all sub trees in traverse method too.
But there is more suitable uniform iteration traversal algorithm, I use the map struct in the code segment where the node is Null.
If you have problem in understand, please feel free to communicate with me.
2022-06-09 00:58:38 +08:00
237dc9d6b3 添加(0925.长按键入.md):增加typescript版本 2022-06-08 12:52:55 +08:00
371564ba3b 添加 0051.N皇后.md Scala版本 2022-06-07 22:19:13 +08:00
7b95f17368 添加(0001.两数之和.md):Dart版本 2022-06-07 13:21:32 +01:00
fa26fb332b 增加 java dp解法 2022-06-07 17:38:37 +08:00
d3e97062bd Merge branch 'youngyangyang04:master' into master 2022-06-07 17:32:22 +08:00
8537401616 添加 0047.全排列II.md Scala版本 2022-06-07 17:24:41 +08:00
97fc88e533 添加 0046.全排列.md Scala版本 2022-06-07 16:59:55 +08:00
091204c926 添加(0129.求根节点到叶节点数字之和.md):增加go版本 2022-06-07 10:46:43 +08:00
87abfa1664 Merge pull request #1344 from GitHubQAQ/patch-2
Update 0063.不同路径II.md  添加预判断代码
2022-06-07 09:53:18 +08:00
58ce246a38 Merge pull request #1343 from wzqwtt/patch15
添加(0150.逆波兰表达式求值、0239.滑动窗口最大值、0347.前K个高频元素)Scala版本
2022-06-07 09:52:24 +08:00
dfcdb734db Merge branch 'youngyangyang04:master' into test01 2022-06-06 20:28:04 +08:00
8e7678351b Merge branch 'youngyangyang04:master' into master 2022-06-06 20:27:54 +08:00
6d5cb71381 Merge pull request #1342 from fmtvar/0028
添加(0028.实现strStr.md):PHP版本
2022-06-06 11:40:17 +08:00
c0542180ac Merge pull request #1341 from wzqwtt/patch14
添加(0020.有效的括号、1047.删除字符串中的所有相邻重复项)Scala版本
2022-06-06 11:39:45 +08:00
49a5d83eb7 Merge pull request #1340 from huangyebiaoke/master
Update 0739.每日温度.md
2022-06-06 11:39:12 +08:00
c53082eb7e Merge pull request #1339 from fmtvar/offer58-2
添加(剑指Offer58-II.左旋转字符串.md):增加PHP版本
2022-06-06 11:38:41 +08:00
41eaab28b8 Merge branch 'master' into offer58-2 2022-06-06 11:38:08 +08:00
17a818c901 Merge pull request #1338 from wzqwtt/patch13
添加(0232.用栈实现队列、0225.用队列实现栈)Scala版本
2022-06-06 11:37:03 +08:00
bdb357e0aa Merge pull request #1337 from tan-i-ham/master
chore: Add new solution to LeetCode 203
2022-06-06 11:36:14 +08:00
cfa0504ea4 Update 0056.合并区间.md 2022-06-05 22:31:41 -04:00
6d804e2b24 更新 111.二叉树的最小深度 的拼写错误及改进规范 2022-06-05 21:24:56 -04:00
9f38af3e3a Update 0452.用最少数量的箭引爆气球.md
更新了java代码,增加了一个 leftmostRightBound variable 记录最小的右边界使得代码可读性增加
加入了comment
解释了Arrays.sort(points, (x, y) -> Integer.compare(x[0], y[0])); 中不用 x[0] - y[0] 而是用Integer.compare(x[0], y[0]) 的原因
加入了时空复杂度和说明
2022-06-05 17:59:15 -04:00
068cc09535 添加 0491.递增子序列.md Scala版本 2022-06-05 14:46:21 +08:00