题目来源 | 编号 | 标题 | 点赞 | 评论 | 作者 | 时间 |
---|---|---|---|---|---|---|
AcWing | 362 | 区间 贪心 + 数据结构做法 | 58 | 24 |
![]() |
2019-11-24 19:00 |
AcWing | 1144 | 连接格点 | 2 | 0 |
![]() |
2019-11-24 18:57 |
AcWing | 840 | 模拟散列表 ( JavaScript ) | 1 | 0 |
![]() |
2019-11-24 18:48 |
AcWing | 1142 | 繁忙的都市 | 0 | 0 |
![]() |
2019-11-24 18:34 |
AcWing | 89 | a^b | 0 | 1 |
![]() |
2019-11-24 18:09 |
AcWing | 1141 | 局域网 | 6 | 0 |
![]() |
2019-11-24 17:53 |
AcWing | 1143 | 联络员 | 2 | 0 |
![]() |
2019-11-24 17:42 |
AcWing | 1142 | 繁忙的都市 | 5 | 0 |
![]() |
2019-11-24 17:34 |
AcWing | 318 | 划分大理石 | 3 | 5 |
![]() |
2019-11-24 16:13 |
AcWing | 343 | 排序 | 15 | 15 |
![]() |
2019-11-24 15:59 |
AcWing | 6 | 多重背包问题 III 详解 + yxc大佬代码解读 | 311 | 141 |
![]() |
2019-11-24 15:56 |
LeetCode | 1268 | 搜索推荐系统 Search Suggestions System | 2 | 3 |
![]() |
2019-11-24 15:31 |
LeetCode | 1267 | 统计参与通信的服务器 Count Servers that Communicate | 1 | 0 |
![]() |
2019-11-24 15:20 |
LeetCode | 1266 | 访问所有点的最小时间 Minimum Time Visiting All Points | 1 | 2 |
![]() |
2019-11-24 15:09 |
AcWing | 1092 | 玩具装箱 | 2 | 0 |
![]() |
2019-11-24 15:06 |
AcWing | 1125 | 牛的旅行 | 27 | 29 |
![]() |
2019-11-24 15:06 |
AcWing | 1125 | 牛的旅行 | 1 | 0 |
![]() |
2019-11-24 14:48 |
AcWing | 1125 | 牛的旅行 | 1 | 2 |
![]() |
2019-11-24 14:45 |
AcWing | 745 | 数组的右上半部分 | 19 | 14 |
![]() |
2019-11-24 14:44 |
AcWing | 1153 | 括号树 | 2 | 0 |
![]() |
2019-11-24 14:44 |
AcWing | 1141 | 局域网 | 1 | 0 |
![]() |
2019-11-24 14:42 |
AcWing | 744 | 数组中的列 | 0 | 0 |
![]() |
2019-11-24 14:33 |
AcWing | 743 | 数组中的行 | 0 | 0 |
![]() |
2019-11-24 14:30 |
AcWing | 742 | 最小数和它的位置 | 0 | 0 |
![]() |
2019-11-24 14:27 |
AcWing | 136 | 邻值查找 | 0 | 0 |
![]() |
2019-11-24 14:07 |
AcWing | 301 | 任务安排2 | 11 | 3 |
![]() |
2019-11-24 14:06 |
AcWing | 1153 | 括号树 | 5 | 0 |
![]() |
2019-11-24 13:45 |
AcWing | 139 | 回文子串的最大长度 | 0 | 0 |
![]() |
2019-11-24 13:44 |
AcWing | 1140 | 最短网络 | 3 | 0 |
![]() |
2019-11-24 13:42 |
AcWing | 1153 | 括号树 | 4 | 1 |
![]() |
2019-11-24 13:30 |
LeetCode | 1269 | Number of Ways to Stay in the Same Place After Some Steps | 4 | 1 |
|
2019-11-24 12:01 |
LeetCode | 1268 | 搜索推荐系统 | 5 | 1 |
|
2019-11-24 12:01 |
LeetCode | 1267 | Count Servers that Communicate | 3 | 0 |
|
2019-11-24 12:01 |
LeetCode | 1266 | Minimum Time Visiting All Points | 2 | 0 |
|
2019-11-24 12:00 |
AcWing | 26 | 二进制中1的个数 | 0 | 0 |
![]() |
2019-11-24 11:24 |
AcWing | 740 | 数组变换 | 0 | 0 |
![]() |
2019-11-24 10:29 |
LeetCode | 3 | Longest Substring Without Repeating Characters | 3 | 0 |
|
2019-11-24 10:12 |
AcWing | 292 | 炮兵阵地 | 3 | 5 |
![]() |
2019-11-24 01:44 |
AcWing | 789 | 暴力碾标算——数的范围(O(n))做法 | 14 | 1 |
![]() |
2019-11-23 22:21 |
AcWing | 839 | 模拟堆 ( JavaScript ) | 2 | 0 |
![]() |
2019-11-23 22:07 |
AcWing | 1020 | 潜水员 | 46 | 10 |
![]() |
2019-11-23 21:16 |
AcWing | 840 | 模拟散列表(set做法) | 1 | 0 |
![]() |
2019-11-23 20:14 |
AcWing | 850 | Dijkstra求最短路 II | 10 | 4 |
![]() |
2019-11-23 19:58 |
AcWing | 361 | 观光奶牛 | 69 | 20 |
![]() |
2019-11-23 18:32 |
AcWing | 291 | 蒙德里安的梦想 | 0 | 0 |
![]() |
2019-11-23 18:07 |
AcWing | 246 | 区间最大公约数 | 6 | 4 |
![]() |
2019-11-23 16:22 |
AcWing | 326 | XOR和路径 | 1 | 0 |
![]() |
2019-11-23 15:26 |
LeetCode | 32 | Longest Valid Parentheses | 4 | 0 |
|
2019-11-23 13:43 |
AcWing | 838 | 堆排序 ( JavaScript ) | 1 | 0 |
![]() |
2019-11-23 13:25 |
LeetCode | 124 | Binary Tree Maximum Path Sum | 0 | 0 |
![]() |
2019-11-23 12:45 |