![](https://img-blog.csdnimg.cn/20201014180756925.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
leetcode
whz-emm
这个作者很懒,什么都没留下…
展开
-
12,整数转罗马数字
class Solution: def intToRoman(self, num: int) -> str: roman_dict = { 1000:'M', 900:'CM', 500:'D', 400:'CD', 100:'C', 90:'XC', 50:'L', 40:'XL', 10:'X...原创 2019-03-13 18:18:44 · 123 阅读 · 0 评论 -
11,盛最多水的容器
class Solution: def maxArea(self, height: List[int]) -> int: l = 0 r = len(height)-1 max_area = 0 while l < r: tmp_area = min(height[l], height[r]...原创 2019-03-13 15:28:50 · 108 阅读 · 0 评论 -
10,正则表达式匹配
class Solution: def isMatch(self, s: str, p: str) -> bool: import re rlt = re.match(p, s) try: if s == rlt.group(): return True e...原创 2019-03-13 15:20:30 · 156 阅读 · 0 评论 -
9,回文数
class Solution: def isPalindrome(self, x: int) -> bool: str_x = str(x) if str_x[0] == "+": str_x = str_x[1:] if str_x == str_x[::-1]: return True...原创 2019-03-13 15:14:21 · 130 阅读 · 0 评论 -
8,字符串转换整数(atoi)
class Solution: def myAtoi(self, str: str) -> int: symbol = "" rlt = "" str = str.lstrip() if not str: return 0 if str[0] == "-": ...原创 2019-03-13 15:09:09 · 127 阅读 · 0 评论 -
7,整数反转
class Solution: def reverse(self, x: int) -> int: str_x = str(x) negative = False if str_x[0] == "-": negative = True str_x = str_x[1:] z...原创 2019-03-13 13:45:29 · 119 阅读 · 0 评论 -
28,实现strStr
class Solution: def strStr(self, haystack: str, needle: str) -> int: # if haystack == needle: # return 0 # len_n = len(needle) # for i in range(len(haystack)...原创 2019-03-18 00:38:38 · 188 阅读 · 0 评论 -
27,移除元素
class Solution: def removeElement(self, nums: List[int], val: int) -> int: i = len(nums)-1 while i >= 0: if nums[i] == val: nums.pop(i) ...原创 2019-03-18 00:26:19 · 103 阅读 · 0 评论 -
26,删除排序数组中的重复项
class Solution: def removeDuplicates(self, nums: List[int]) -> int: try: i = len(nums)-1 while 0 < i: if nums[i] == nums[i-1]: ...原创 2019-03-18 00:20:46 · 140 阅读 · 0 评论 -
14,最长公共前缀
class Solution: def longestCommonPrefix(self, strs: List[str]) -> str: rlt = '' test_list = [] pos = 0 while True: try: for s in strs...原创 2019-03-14 14:06:29 · 154 阅读 · 0 评论 -
1,两数之和
class Solution: def twoSum(self, nums: 'List[int]', target: 'int') -> 'List[int]': sorted_nums = sorted(nums) i = 0 j = len(sorted_nums)-1 while i < len(sorte...原创 2019-03-11 10:00:02 · 101 阅读 · 0 评论 -
15,三数之和
class Solution: def threeSum(self, nums: List[int]) -> List[List[int]]: rlt = [] nums.sort() for i in range(len(nums)): l = i + 1 r = len(nums)-1...原创 2019-03-14 20:07:30 · 111 阅读 · 0 评论 -
16,最接近的三数之和
class Solution: def threeSumClosest(self, nums: List[int], target: int) -> int: nums.sort() rlt_min = 9999999 rlt = 0 for i in range(len(nums)): l = ...原创 2019-03-15 01:18:15 · 147 阅读 · 0 评论 -
2,两数相加
class Solution: def addTwoNumbers(self, l1, l2): new_list = ListNode(0) p = new_list #进位 add_val = 0 while l1 or l2: l1_val = l1.val if l1 else ...原创 2019-03-11 09:59:35 · 124 阅读 · 0 评论 -
17,电话号码的字母组合
class Solution(object): def letterCombinations(self, digits): self.src_list = ['', '', ['a', 'b', 'c'], ['d', 'e', 'f'], ['g', '...原创 2019-03-15 14:05:47 · 146 阅读 · 0 评论 -
3,无重复字符的最长子串
class Solution: def lengthOfLongestSubstring(self, s: str) -> int: if not s: return 0 max_len = 1 l_one = 0 l_two = 1 tmp_set = set() ...原创 2019-03-11 11:06:13 · 168 阅读 · 0 评论 -
4, 寻找两个有序数组的中位数
class Solution: def findMedianSortedArrays(self, nums1: List[int], nums2: List[int]) -> float: nums1.extend(nums2) sorted_nums1 = sorted(nums1) len_nums1 = len(nums1) ...原创 2019-03-11 11:16:34 · 142 阅读 · 0 评论 -
18,四数之和
class Solution: def fourSum(self, nums: List[int], target: int) -> List[List[int]]: if len(nums) < 4: return [] nums.sort() rlt = [] len_nums = le...原创 2019-03-16 00:28:53 · 276 阅读 · 0 评论 -
19,删除链表的倒数第N个节点
class Solution: def removeNthFromEnd(self, head: ListNode, n: int) -> ListNode: tmp = head while tmp: if tmp == head: last = None new_tmp...原创 2019-03-16 00:49:59 · 86 阅读 · 0 评论 -
20,有效的括号
class Solution: def isValid(self, s: str) -> bool: li = [] for i in s: if i in ["(", "{", "["]: li.append(i) elif i == ")": ...原创 2019-03-16 01:00:28 · 99 阅读 · 0 评论 -
21,合并两个有序链表
class Solution: def mergeTwoLists(self, l1: ListNode, l2: ListNode) -> ListNode: rlt = ListNode(0) tmp = rlt while l1 or l2: if not l1: tmp.n...原创 2019-03-16 01:14:41 · 190 阅读 · 0 评论 -
5,最长回文子串
class Solution: def longestPalindrome(self, s: str) -> str: if len(s) <= 1: return s if len(set(s)) == 1: return s l = 0 r = len(s) ...原创 2019-03-12 14:56:18 · 97 阅读 · 0 评论 -
23,合并k个排序链表
class Solution: def mergeKLists(self, lists: List[ListNode]) -> ListNode: if not lists: return None new_li = ListNode(0) p = new_li node_li = [] ...原创 2019-03-17 00:24:31 · 97 阅读 · 0 评论 -
24, 两两交换链表中的节点
class Solution: def swapPairs(self, head: ListNode) -> ListNode: node_list = [] while head: node_list.append(head.val) head = head.next if len(no...原创 2019-03-17 00:56:05 · 100 阅读 · 0 评论 -
6,z字型变换
class Solution: def convert(self, s: str, numRows: int) -> str: if numRows == 1 or len(s) == 1: return s rlt_list = [] for i in range(numRows): c...原创 2019-03-12 16:34:32 · 138 阅读 · 0 评论 -
13,罗马数字转整数
class Solution: def romanToInt(self, s: str) -> int: roman_dict = { 'M':1000, 'D':500, 'C':100, 'L':50, 'X':10, ...原创 2019-03-14 13:45:21 · 144 阅读 · 0 评论