题目来源 | 编号 | 标题 | 点赞 | 评论 | 作者 | 时间 |
---|---|---|---|---|---|---|
AcWing | 89 | a^b | 25 | 25 |
![]() |
2019-01-17 09:45 |
AcWing | 95 | 费解的开关 | 2 | 11 |
![]() |
2019-01-16 23:12 |
LeetCode | 865 | Smallest Subtree with all the Deepest Nodes | 0 | 0 |
|
2019-01-15 13:37 |
LeetCode | 866 | Prime Palindrome | 2 | 0 |
|
2019-01-15 12:53 |
LeetCode | 867 | Transpose Matrix | 0 | 0 |
|
2019-01-15 11:58 |
LeetCode | 868 | Binary Gap | 0 | 0 |
|
2019-01-15 11:51 |
LeetCode | 880 | Decoded String at Index | 2 | 0 |
|
2019-01-15 04:24 |
LeetCode | 976 | Largest Perimeter Triangle | 0 | 0 |
|
2019-01-15 03:32 |
LeetCode | 975 | Odd Even Jump | 0 | 1 |
|
2019-01-15 02:38 |
AcWing | 51 | 数字排列 | 58 | 12 |
![]() |
2019-01-15 02:17 |
AcWing | 44 | 分行从上往下打印二叉树-(BFS)(记录需要出栈次数) | 2 | 1 |
![]() |
2019-01-14 21:23 |
LeetCode | 974 | Subarray Sums Divisible by K | 3 | 4 |
|
2019-01-14 14:02 |
LeetCode | 973 | K Closest Points to Origin | 3 | 0 |
|
2019-01-14 13:48 |
AcWing | 44 | 分行从上往下打印二叉树 | 107 | 14 |
![]() |
2019-01-11 04:41 |
LeetCode | 882 | Reachable Nodes In Subdivided Graph | 0 | 0 |
|
2019-01-10 11:30 |
LeetCode | 889 | Construct Binary Tree from Preorder and Postorder Traversal | 1 | 0 |
|
2019-01-10 10:00 |
LeetCode | 892 | Surface Area of 3D Shapes | 1 | 1 |
|
2019-01-10 08:04 |
LeetCode | 893 | Groups of Special-Equivalent Strings | 0 | 0 |
|
2019-01-10 07:45 |
LeetCode | 894 | All Possible Full Binary Trees | 1 | 0 |
|
2019-01-10 07:25 |
AcWing | 42 | 栈的压入、弹出序列 | 17 | 12 |
![]() |
2019-01-09 06:20 |
AcWing | 85 | 不用加减乘除做加法 | 47 | 14 |
![]() |
2019-01-08 12:38 |
LeetCode | 897 | Increasing Order Search Tree | 1 | 0 |
|
2019-01-08 10:53 |
LeetCode | 899 | Orderly Queue | 4 | 1 |
|
2019-01-08 10:14 |
AcWing | 86 | 构建乘积数组 | 12 | 3 |
![]() |
2019-01-07 20:12 |
AcWing | 88 | 树中两个结点的最低公共祖先 | 36 | 3 |
![]() |
2019-01-07 19:55 |
LeetCode | 838 | Push Dominoes | 0 | 0 |
![]() |
2019-01-07 17:08 |
LeetCode | 964 | Least Operators to Express Number | 1 | 3 |
|
2019-01-07 06:31 |
LeetCode | 971 | Flip Binary Tree To Match Preorder Traversal | 2 | 3 |
|
2019-01-07 04:50 |
LeetCode | 970 | Powerful Integers | 0 | 0 |
|
2019-01-07 04:14 |
LeetCode | 969 | Pancake Sorting | 2 | 3 |
|
2019-01-07 03:56 |
AcWing | 45 | 之字形打印二叉树 | 14 | 6 |
![]() |
2019-01-07 01:46 |
AcWing | 44 | 分行从上往下打印二叉树 | 41 | 2 |
![]() |
2019-01-07 01:41 |
AcWing | 43 | 不分行从上往下打印二叉树 | 25 | 8 |
![]() |
2019-01-07 01:38 |
AcWing | 41 | 包含min函数的栈 | 64 | 21 |
![]() |
2019-01-07 01:21 |
AcWing | 40 | 顺时针打印矩阵 | 42 | 29 |
![]() |
2019-01-07 01:19 |
AcWing | 39 | 对称的二叉树 | 48 | 18 |
![]() |
2019-01-07 01:12 |
AcWing | 38 | 二叉树的镜像 | 29 | 26 |
![]() |
2019-01-07 01:10 |
AcWing | 37 | 树的子结构 | 64 | 29 |
![]() |
2019-01-07 00:54 |
AcWing | 36 | 合并两个排序的链表 | 147 | 97 |
![]() |
2019-01-07 00:00 |
AcWing | 35 | 反转链表 | 191 | 41 |
![]() |
2019-01-06 23:56 |
AcWing | 34 | 链表中环的入口结点 | 95 | 39 |
![]() |
2019-01-06 17:41 |
AcWing | 33 | 链表中倒数第k个节点 | 25 | 20 |
![]() |
2019-01-06 17:27 |
AcWing | 32 | 调整数组顺序使奇数位于偶数前面 | 104 | 79 |
![]() |
2019-01-06 17:16 |
LeetCode | 900 | RLE Iterator | 2 | 0 |
|
2019-01-06 13:35 |
AcWing | 31 | 表示数值的字符串 | 35 | 25 |
![]() |
2019-01-06 02:36 |
AcWing | 30 | 正则表达式匹配 | 206 | 69 |
![]() |
2019-01-06 02:29 |
AcWing | 29 | 删除链表中重复的节点 | 106 | 82 |
![]() |
2019-01-06 02:27 |
AcWing | 28 | 在O(1)时间删除链表结点 | 146 | 65 |
![]() |
2019-01-06 02:20 |
AcWing | 27 | 数值的整数次方 | 34 | 54 |
![]() |
2019-01-06 02:12 |
AcWing | 26 | 二进制中1的个数 | 92 | 64 |
![]() |
2019-01-06 02:01 |