![](https://img-blog.csdnimg.cn/20201014180756919.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
leetcode
Chavez126
这个作者很懒,什么都没留下…
展开
-
动态规划篇
16. 3Sum Closest 给定数组sums和目标数target,寻找sums的三个数,使得它们之和最接近于target。 https://leetcode.com/problems/3sum-closest/description/ class Solution: def threeSumClosest(self, nums, target): """ ...原创 2018-07-19 15:02:30 · 140 阅读 · 0 评论 -
leetcode
class Solution(object): def myAtoi(self, str): """ :type str: str :rtype: int """ flag=False ret=0 pos=1 for s in str: ...原创 2018-09-01 17:08:41 · 117 阅读 · 0 评论