题目来源 | 编号 | 标题 | 点赞 | 评论 | 作者 | 时间 |
---|---|---|---|---|---|---|
AcWing | 890 | 能被整除的数(容斥原理) | 2 | 0 |
![]() |
2020-12-06 23:34 |
AcWing | 336 | 邮局 | 2 | 2 |
![]() |
2020-12-06 22:28 |
AcWing | 2019ICPC上海站区域赛F | A Simple Problem On A Tree【树剖/线段树】 | 7 | 0 |
![]() |
2020-12-06 21:57 |
AcWing | 26 | 二进制中1的个数 | 0 | 0 |
|
2020-12-06 21:27 |
LeetCode | 1681 | 最小不兼容性(DFS/状压dp) | 0 | 0 |
![]() |
2020-12-06 21:07 |
LeetCode | 1681 | 最小不兼容性 | 2 | 3 |
![]() |
2020-12-06 20:47 |
AcWing | 899 | 编辑距离_java | 0 | 0 |
![]() |
2020-12-06 20:39 |
AcWing | 1 | A + B | 2 | 0 |
![]() |
2020-12-06 20:01 |
AcWing | 26 | JAVA 二进制中1的个数 | 0 | 1 |
![]() |
2020-12-06 19:43 |
LeetCode | 1680 | 连接连续二进制数字 | 2 | 2 |
![]() |
2020-12-06 18:28 |
LeetCode | 5620 | 连接连续二进制数字 | 2 | 0 |
![]() |
2020-12-06 18:13 |
AcWing | 2816 | 判断子序列 | 9 | 6 |
![]() |
2020-12-06 18:02 |
LeetCode | 5620 | 连接连续二进制数字 | 0 | 0 |
![]() |
2020-12-06 17:51 |
LeetCode | 1673 | 找出最具竞争力的子序列 | 0 | 0 |
![]() |
2020-12-06 17:30 |
LeetCode | 1672 | 最富有客户的资产总量 | 0 | 0 |
![]() |
2020-12-06 17:28 |
LeetCode | 5617 | 设计 Goal 解析器【Java】 | 0 | 0 |
![]() |
2020-12-06 17:27 |
LeetCode | 5618 | K 和数对的最大数目【Java】 | 0 | 0 |
![]() |
2020-12-06 17:25 |
AcWing | 998 | 起床困难综合症 | 25 | 44 |
![]() |
2020-12-06 17:11 |
AcWing | 845 | 八数码(手写hash和queue) | 0 | 4 |
![]() |
2020-12-06 17:02 |
AcWing | 800 | 数组元素的目标和 | 10 | 2 |
![]() |
2020-12-06 16:34 |
AcWing | 6 | 多重背包问题 III(详细分析版) | 81 | 14 |
![]() |
2020-12-06 16:30 |
AcWing | 788 | 逆序对的数量 | 2 | 1 |
![]() |
2020-12-06 16:21 |
LeetCode | 5619 | 最小不兼容性 | 4 | 0 |
![]() |
2020-12-06 16:17 |
AcWing | 897 | 最长公共子序列 | 0 | 0 |
![]() |
2020-12-06 15:33 |
AcWing | 606 | 平均数1 | 0 | 4 |
![]() |
2020-12-06 14:30 |
AcWing | 1359 | 城堡[BFS or DFS] | 3 | 0 |
![]() |
2020-12-06 14:25 |
LeetCode | 1679 | K 和数对的最大数目 | 1 | 0 |
![]() |
2020-12-06 12:50 |
AcWing | 1086 | 恨7不成妻 | 4 | 0 |
![]() |
2020-12-06 12:30 |
AcWing | 1484 | 最佳排名 | 0 | 0 |
![]() |
2020-12-06 12:29 |
LeetCode | 1678 | 设计 Goal 解析器 | 2 | 0 |
![]() |
2020-12-06 12:29 |
AcWing | 786 | 第k个数 | 0 | 0 |
![]() |
2020-12-06 10:23 |
AcWing | 787 | 归并排序 | 0 | 0 |
![]() |
2020-12-06 10:21 |
AcWing | 822 | 走方格 | 1 | 0 |
![]() |
2020-12-06 10:18 |
AcWing | 741 | 斐波那契数列 | 0 | 0 |
![]() |
2020-12-06 10:17 |
AcWing | 821 | 跳台阶 | 0 | 0 |
![]() |
2020-12-06 10:15 |
AcWing | 795 | 前缀和 | 1 | 0 |
![]() |
2020-12-06 10:07 |
LeetCode | 76 | 最小覆盖子串 | 0 | 0 |
![]() |
2020-12-06 09:54 |
AcWing | 828 | 模拟栈 | 1 | 0 |
![]() |
2020-12-06 09:33 |
AcWing | 770 | 单词替换 | 0 | 0 |
![]() |
2020-12-06 09:02 |
AcWing | 888 | 求组合数 IV(高精度-素数组合) | 100 | 39 |
![]() |
2020-12-05 22:58 |
AcWing | 799 | 最长连续不重复子序列 | 1 | 0 |
![]() |
2020-12-05 22:56 |
AcWing | 835 | Trie字符串统计--慢慢来,比较快 | 3 | 1 |
![]() |
2020-12-05 22:45 |
洛谷 | P3371 | 【模板】单源最短路径(弱化版) 题解 | 5 | 0 |
![]() |
2020-12-05 21:53 |
AcWing | 77 | 翻转单词顺序 | 1 | 0 |
![]() |
2020-12-05 21:43 |
AcWing | 887 | 求组合数 III(lucas定理) | 115 | 43 |
![]() |
2020-12-05 21:27 |
AcWing | 1118 | 分成互质组 | 0 | 0 |
![]() |
2020-12-05 21:11 |
AcWing | 1444 | 赛跑 | 4 | 0 |
![]() |
2020-12-05 20:38 |
AcWing | 718 | 实验 | 2 | 1 |
![]() |
2020-12-05 19:54 |
AcWing | 794 | 高精度除法 | 1 | 0 |
![]() |
2020-12-05 19:48 |
AcWing | 896 | 最长上升子序列 II(求长度和序列) | -1 | 0 |
![]() |
2020-12-05 19:43 |