- 博客(2)
- 收藏
- 关注
原创 【Leetcode】Best Time to Buy and Sell Stock
1 题目2 Python代码class Solution(object): def maxProfit(self, prices): """ :type prices: List[int] :rtype: int """ if len(prices) == 0: return 0
2015-09-20 15:17:37 343
原创 【LeetCode】258 Add Digits
1. 题目描述Given a non-negative integer num, repeatedly add all its digits until the result has only one digit.For example:Given num = 38, the process is like: 3 + 8 = 11, 1 + 1 = 2. Since 2 has only one d
2015-09-17 23:18:47 1025
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人