
LeetCode
Circle_Z
我把车窗打开,信纸随风而去,也许它会回到我们相遇的地方--池塘边,也许它会飞到一个我们都不认识的地方,也许......
展开
专栏收录文章
- 默认排序
- 最新发布
- 最早发布
- 最多阅读
- 最少阅读
-
leetcode 104_MaximumDepthOfBinaryTree_easy.py
github : https://github.com/CircleZ3791117 #!/usr/bin/env python # -*- coding: utf-8 -*- __author__ = 'circlezhou' ''' Description: Given a binary tree, find its maximum depth. The maximum depth is原创 2018-01-23 14:39:38 · 254 阅读 · 0 评论 -
leetcode 136_SingleNumber_easy.py
github: https://github.com/CircleZ3791117 #!/usr/bin/env python # -*- coding: utf-8 -*- __author__ = 'circlezhou' ''' Description: Given an array of integers, every element appears twice except for原创 2018-01-23 14:46:47 · 318 阅读 · 0 评论 -
leetcode 226_InvertBinaryTree_easy.py
github: https://github.com/CircleZ3791117 #!/usr/bin/env python # -*- coding: utf-8 -*- __author__ = 'circlezhou' ''' Description: Invert a binary tree. 4 / \ 2 7 / \ / \ 1 3 6原创 2018-01-23 14:49:56 · 302 阅读 · 0 评论 -
leetcode 258_AddDigits_easy.py
github: https://github.com/CircleZ3791117/ #!/usr/bin/env python # -*- coding: utf-8 -*- ''' Description: Given a non-negative integer num, repeatedly add all its digits until the result has only原创 2018-01-23 14:52:36 · 383 阅读 · 0 评论