题目来源 | 编号 | 标题 | 点赞 | 评论 | 作者 | 时间 |
---|---|---|---|---|---|---|
AcWing | 302 | 任务安排3 | 6 | 16 |
![]() |
2019-11-19 09:27 |
AcWing | 183 | 靶形数独 | 3 | 2 |
![]() |
2019-11-18 21:51 |
AcWing | 1083 | Windy数 | 0 | 0 |
![]() |
2019-11-18 21:46 |
AcWing | 1081 | 度的数量 | 4 | 17 |
![]() |
2019-11-18 21:39 |
AcWing | 838 | 堆排序 分析i=n/2 | 287 | 84 |
![]() |
2019-11-18 16:43 |
AcWing | 1091 | 理想的正方形 | 6 | 3 |
![]() |
2019-11-18 16:42 |
AcWing | 143 | 最大异或对 分析二维数组son | 56 | 42 |
![]() |
2019-11-18 16:07 |
AcWing | 793 | 高精度乘法 | 1 | 0 |
![]() |
2019-11-18 15:01 |
AcWing | 87 | Python 题解 把字符串转换成整数 | 3 | 0 |
![]() |
2019-11-18 15:01 |
AcWing | 791 | 高精度加法 | 0 | 0 |
![]() |
2019-11-18 12:51 |
AcWing | 792 | 高精度减法 | 1 | 0 |
![]() |
2019-11-18 12:49 |
LeetCode | 1263 | Minimum Moves to Move a Box to Their Target Location | 3 | 1 |
|
2019-11-18 03:15 |
LeetCode | 1262 | Greatest Sum Divisible by Three | 4 | 0 |
|
2019-11-18 00:46 |
LeetCode | 1261 | Find Elements in a Contaminated Binary Tree | 3 | 0 |
|
2019-11-18 00:15 |
LeetCode | 1260 | Shift 2D Grid | 3 | 0 |
|
2019-11-18 00:01 |
AcWing | 102 | 最佳牛围栏 | 1 | 0 |
![]() |
2019-11-17 22:04 |
AcWing | 107 | 超快速排序 | 0 | 0 |
![]() |
2019-11-17 21:14 |
AcWing | 860 | 染色法判定二分图: Python+BFS | 2 | 4 |
![]() |
2019-11-17 20:00 |
AcWing | 860 | 染色法判定二分图 | 27 | 13 |
![]() |
2019-11-17 16:37 |
AcWing | 859 | Kruskal算法求最小生成树 | 26 | 6 |
![]() |
2019-11-17 15:28 |
AcWing | 858 | Prim算法求最小生成树 | 19 | 3 |
![]() |
2019-11-17 14:35 |
AcWing | 445 | 数字反转 | 0 | 0 |
![]() |
2019-11-17 14:01 |
LeetCode | 1262 | 可被三整除的最大和 | 0 | 0 |
![]() |
2019-11-17 13:34 |
LeetCode | 1261 | 在受污染的二叉树中查找元素 Find Elements in a Contaminated Binary Tree | 1 | 0 |
![]() |
2019-11-17 13:24 |
LeetCode | 214 | Shortest Palindrome | 2 | 0 |
|
2019-11-17 10:29 |
AcWing | 854 | Floyd求最短路 | 75 | 8 |
![]() |
2019-11-17 01:01 |
AcWing | 852 | spfa判断负环 | 265 | 79 |
![]() |
2019-11-17 00:55 |
LeetCode | 1259 | Handshakes That Don't Cross | 2 | 0 |
|
2019-11-17 00:01 |
LeetCode | 1258 | Synonymous Sentences | 3 | 0 |
|
2019-11-17 00:01 |
LeetCode | 1257 | Smallest Common Region | 3 | 1 |
|
2019-11-17 00:01 |
LeetCode | 1256 | Encode Number | 2 | 0 |
|
2019-11-17 00:00 |
AcWing | 421 | 陶陶摘苹果 | 1 | 0 |
![]() |
2019-11-16 20:55 |
AcWing | 851 | spfa求最短路 | 77 | 10 |
![]() |
2019-11-16 15:05 |
AcWing | 853 | 有边数限制的最短路 | 409 | 102 |
![]() |
2019-11-16 14:35 |
AcWing | 1 | A + B | 0 | 0 |
![]() |
2019-11-16 14:01 |
AcWing | 487 | 金明的预算方案 | 4 | 4 |
![]() |
2019-11-16 10:57 |
LeetCode | 30 | Substring with Concatenation of All Words | 5 | 0 |
|
2019-11-16 07:36 |
LeetCode | 1203 | Sort Items by Groups Respecting Dependencies | 0 | 0 |
![]() |
2019-11-16 01:43 |
AcWing | 2 | 01背包问题题解 | 0 | 0 |
![]() |
2019-11-15 21:54 |
AcWing | 218 | 扑克牌 | 8 | 2 |
![]() |
2019-11-15 17:55 |
LeetCode | 188 | Best Time to Buy and Sell Stock IV | 24 | 8 |
![]() |
2019-11-15 17:51 |
AcWing | 486 | 等价表达式 | 7 | 11 |
![]() |
2019-11-15 17:25 |
AcWing | 803 | 区间合并 ( JavaScript ) | 1 | 0 |
![]() |
2019-11-15 17:21 |
AcWing | 802 | 区间和 ( JavaScript ) | 1 | 0 |
![]() |
2019-11-15 16:10 |
AcWing | 226 | 233矩阵 | 2 | 0 |
![]() |
2019-11-15 13:55 |
AcWing | 858 | Prim算法求最小生成树 | 1 | 3 |
![]() |
2019-11-15 12:38 |
LeetCode | 345 | 反转字符串中的元音字母 | 0 | 0 |
![]() |
2019-11-15 11:07 |
LeetCode | 344 | 反转字符串 | 0 | 0 |
![]() |
2019-11-15 10:54 |
LeetCode | 342 | 4的幂 | 2 | 0 |
![]() |
2019-11-15 10:49 |
LeetCode | 326 | 3的幂 | 0 | 0 |
![]() |
2019-11-15 10:40 |