题目来源 | 编号 | 标题 | 点赞 | 评论 | 作者 | 时间 |
---|---|---|---|---|---|---|
LeetCode | 47 | 全排列 II | 0 | 0 |
![]() |
2019-09-14 08:08 |
LeetCode | 79 | 单词搜索 | 0 | 0 |
![]() |
2019-09-14 07:31 |
LeetCode | 17 | 电话号码的字母组合 | 2 | 1 |
![]() |
2019-09-14 06:18 |
AcWing | 434 | 排座椅 | 22 | 0 |
![]() |
2019-09-14 05:44 |
AcWing | 430 | 纪念品分组 | 17 | 2 |
![]() |
2019-09-14 05:25 |
AcWing | 420 | 火星人 | 51 | 3 |
![]() |
2019-09-14 05:08 |
LeetCode | 373 | 373. Find K Pairs with Smallest Sums Python | 1 | 0 |
|
2019-09-14 00:31 |
LeetCode | 437 | Path Sum III | 2 | 1 |
![]() |
2019-09-13 23:08 |
AcWing | 6 | 多重背包问题 III | 0 | 2 |
![]() |
2019-09-13 20:40 |
AcWing | 142 | 前缀统计 | 0 | 0 |
![]() |
2019-09-13 17:52 |
AcWing | 2 | 01背包问题(看这篇就完事) | 256 | 108 |
![]() |
2019-09-13 17:07 |
AcWing | 363 | B城 | 2 | 0 |
![]() |
2019-09-13 14:12 |
AcWing | 271 | 杨老师的照相排列 | 8 | 0 |
![]() |
2019-09-13 13:21 |
LeetCode | 316 | Remove Duplicate Letters | 10 | 0 |
|
2019-09-13 13:07 |
LeetCode | 49 | 字符串: Group Anagrams | 6 | 3 |
![]() |
2019-09-13 10:35 |
LeetCode | 221 | Maximal Square | 1 | 0 |
![]() |
2019-09-13 01:20 |
AcWing | 786 | 写一个和yxc大佬不同但差不多思想的方法,代码更简单 | 164 | 56 |
![]() |
2019-09-13 00:10 |
AcWing | 89 | a^b | 1 | 0 |
![]() |
2019-09-12 23:36 |
AcWing | 826 | 单链表 | 0 | 2 |
![]() |
2019-09-12 23:10 |
LeetCode | 174 | Dungeon Game | 3 | 0 |
![]() |
2019-09-12 22:56 |
LeetCode | 152 | Maximum Product Subarray | 7 | 2 |
![]() |
2019-09-12 21:57 |
AcWing | 344 | 观光之旅 | 5 | 3 |
![]() |
2019-09-12 13:25 |
AcWing | 369 | 北大ACM队的远足(代码简洁) | 1 | 8 |
![]() |
2019-09-12 11:29 |
AcWing | 110 | 防晒(权值线段树版) | 0 | 2 |
![]() |
2019-09-12 11:07 |
AcWing | 49 | 二叉搜索树与双向链表 -- 中序遍历的非递归java版 | 1 | 0 |
![]() |
2019-09-12 11:00 |
AcWing | 48 | 复杂链表的复刻--java+复制节点 | 2 | 0 |
![]() |
2019-09-12 10:17 |
AcWing | 835 | Trie字符串统计--TrieNode方法 | 0 | 0 |
|
2019-09-12 03:09 |
LeetCode | 4 | Median of Two Sorted Arrays | 37 | 4 |
![]() |
2019-09-12 02:05 |
AcWing | 101 | 最高的牛 | 3 | 2 |
![]() |
2019-09-12 00:41 |
AcWing | 47 | 二叉树中和为某一值的路径 - java + dfs | 1 | 0 |
![]() |
2019-09-11 23:56 |
AcWing | 1 | A + B | -25 | 7 |
![]() |
2019-09-11 20:57 |
AcWing | 875 | 快速幂 | 0 | 0 |
![]() |
2019-09-11 18:27 |
AcWing | 8 | 二维费用的背包问题 | 0 | 0 |
![]() |
2019-09-11 17:14 |
AcWing | 3 | 完全背包问题 | 0 | 0 |
![]() |
2019-09-11 17:09 |
AcWing | 2 | 01背包问题 | 0 | 0 |
![]() |
2019-09-11 17:08 |
AcWing | 795 | 前缀和 | 0 | 1 |
![]() |
2019-09-11 12:53 |
AcWing | 795 | 前缀和 | 0 | 0 |
![]() |
2019-09-11 12:53 |
AcWing | 797 | 差分 | -2 | 0 |
![]() |
2019-09-11 12:39 |
AcWing | 843 | python版:n-皇后问题 | 2 | 1 |
![]() |
2019-09-11 11:56 |
AcWing | 51 | 数字排列 | 0 | 0 |
![]() |
2019-09-11 11:01 |
AcWing | 361 | 观光奶牛 | 3 | 2 |
![]() |
2019-09-10 23:27 |
AcWing | 838 | 堆排序 | 0 | 0 |
![]() |
2019-09-10 22:21 |
AcWing | 785 | 快速排序 | 0 | 0 |
![]() |
2019-09-10 21:49 |
AcWing | 785 | 快速排序,python看这 | 3 | 4 |
![]() |
2019-09-10 20:26 |
AcWing | 40 | 顺时针打印矩阵 | 0 | 0 |
![]() |
2019-09-10 17:51 |
LeetCode | 44 | Wildcard Matching | 1 | 0 |
![]() |
2019-09-10 16:10 |
AcWing | 179 | AcWing 179. 八数码 | 1 | 0 |
![]() |
2019-09-10 14:30 |
AcWing | 79 | 滑动窗口的最大值模板——python | 4 | 0 |
![]() |
2019-09-10 14:23 |
AcWing | 362 | 区间 | 1 | 0 |
![]() |
2019-09-10 12:47 |
AcWing | 5 | 多重背包问题 II | -2 | 0 |
![]() |
2019-09-10 11:02 |