|
| 1 | +# daily task |
| 2 | +[task.leetcode] |
| 3 | +describe = "今天的 LeetCode 题目是 #%v, 试着在20分钟内解决它吧! You can do it!" |
| 4 | +tasks = [ |
| 5 | + 704, 27, 977, 209, 59, # 数组 |
| 6 | + 203, 707, 206, 24, 19, 142, # 链表 |
| 7 | + 242, 1002, 349, 202, 1, 454, 383, 15, 18, # 哈希表 |
| 8 | + 344, 541, 151, 459, # 字符串 |
| 9 | + 27, 344, 151, 206, 19, 142, 15, 18, # 双指针法 |
| 10 | + 232, 225, 20, 1047, 150, 239, 347, # 栈与队列 |
| 11 | + 226, 101, 104, 111, 222, 110, 257, 404, 513, 112, 106, 654, 617, 700, 98, 530, 501, 236, 235, 701, 450, 669, 108, 538,# 二叉树 |
| 12 | + 77, 216, 17, 39, 40, 131, 93, 78, 90, 491, 46, 47, 332, 51, 37,# 回溯 |
| 13 | + 455, 376, 53, 122, 55, 45, 1005, 134, 135, 860, 406, 406, 452, 435, 763, 56, 738, 968,# 贪心算法 |
| 14 | + 509, 70, 746, 62, 63, 343, 96, 416, 1049, 494, 474, 518, 377, 70, 322, 279, 139, 198, 213, 337, 121, 122, 123, 188, 309, 714, 300, 674, 718, 1143, 1035, 53, 392, 115, 583, 72, 647, 516, # 动态规划 |
| 15 | + 739, 496, 503, 42, 84, # 单调栈 |
| 16 | +] |
| 17 | +cycle = true |
| 18 | + |
| 19 | +[task.reading] |
| 20 | +describe = "今天的回顾旧书是 %v, 享受阅读的乐趣吧!" |
| 21 | +tasks = [ |
| 22 | + "《这些人那些事》", |
| 23 | + "《The Minimalist Entrepreneur》", |
| 24 | + "《侠隐》", |
| 25 | +] |
| 26 | +cycle = false |
0 commit comments