Three Sum(求三数之和)
英文版:https://leetcode.com/problems/3sum/
中文版:https://leetcode-cn.com/problems/3sum/
Majority Element(求众数)
英文版:https://leetcode.com/problems/majority-element/
中文版:https://leetcode-cn.com/problems/majority-element/
见证python暴力的时候到了,一行代码搞定:
return sorted(nums)[int(len(nums)/2)]
Missing Positive(求缺失的第一个正数)
英文版:https://leetcode.com/problems/first-missing-positive/
中文版:https://leetcode-cn.com/problems/first-missing-positive/
Reverse String (反转字符串)
英文版:https://leetcode.com/problems/reverse-string/
中文版:https://leetcode-cn.com/problems/reverse-string/
用python自带的函数反而是用时最少的,第一种放大是自建循环,用时居中,172s。
Reverse Words in a String(翻转字符串里的单词)
英文版:https://leetcode.com/problems/reverse-words-in-a-string/
中文版:https://leetcode-cn.com/problems/reverse-words-in-a-string/
String to Integer (atoi)(字符串转换整数 (atoi))
英文版:https://leetcode.com/problems/string-to-integer-atoi/
中文版:https://leetcode-cn.com/problems/string-to-integer-atoi/
class Solution:
def myAtoi(self, s):
"""
:type str: str
:rtype: int
"""
s = s.lstrip()
length = len(s)
if length == 0 or s[0] not in '0123456789+-':
return 0
index = 1
while index < length and s[index].isdigit():
index += 1
if index == 1 and s[0] in '+-':
return 0
result = int(s[:index])
if result < 0:
return max(-2147483648, result)
else:
return min(2147483647, result)
Reference:
Leetcode-15: https://www.jianshu.com/p/dd8dcdd2baf8
Leetcode-41: https://blog.csdn.net/weixin_40449300/article/details/82532996
Leetcode-151: https://blog.csdn.net/sxingming/article/details/51597524
本文分享自 MiningAlgorithms 微信公众号,前往查看
如有侵权,请联系 cloudcommunity@tencent.com 删除。
本文参与 腾讯云自媒体分享计划 ,欢迎热爱写作的你一起参与!