- 博客(2)
- 资源 (1)
- 收藏
- 关注
RSS订阅原创 leetCode自学笔记2：整数反转
class Solution { public: int reverse(int x) { long rev = 0; while (x) { int pop = x % 10; x /= 10; rev = rev * 10 + pop; } return (rev > INT_MAX || rev &l...
2019-08-21 00:07:29
140
原创 leetCode自学笔记1：两数之和
题解的答案： hashmap={} for index,num in enumerate(nums): another_num=target-num if another_num in hashmap: return[hashmap[index,another_num]] ...
2019-08-19 14:29:02
148
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人