LeetCode

Leetcode

2019-11-21

#3 Solution 1 [Best SE]

1

2

3

4

5

6

7

8

9

10

11

12

13

14

15

16

17

18

19

20

21

22

23

24

25

26

class Solution:

def lengthOfLongestSubstring(self, s: str) -> int:

if s == '':

return 0

if len(set(s)) == 1:

return 1

h = 0

t = 1

n = 1

m = 1

l = len(s)

while True:

if s[t] in s[h:t]:

n = t - h

h = s[h:t].index(s[t])+h+1

t = h + 1

m = max(m, n)

n = 1

else:

t += 1

n += 1

if t == l:

break

m = max(m, n)

return m

[……]阅读全文

Leetcode

2019-11-20

#2 Solution 1 [BEST SE]

1

2

3

4

5

6

7

8

9

10

11

12

13

14

15

16

17

18

19

20

21

22

23

24

25

26

27

28

# Definition for singly-linked list.

# class ListNode:

# def __init__(self, x):

# self.val = x

# self.next = None

class Solution:

def addTwoNumbers(self, l1: ListNode, l2: ListNode) -> ListNode:

flag = 0

l = ListNode(0)

tmp = l

while l1 is not None or l2 is not None:

a1 = 0

b1 = 0

if l1 is not None:

a1 = l1.val

l1 = l1.next

if l2 is not None:

b1 = l2.val

l2 = l2.next

s = a1 + b1 + flag

r = int(s % 10)

flag = s // 10

tmp.next = ListNode(r)

tmp = tmp.next

if flag == 1:

tmp.next = ListNode(1)

return l.next

[……]阅读全文

Leetcode

2019-11-20

#1 Solution 2 [Best TE]

1

2

3

4

5

6

7

8

9

10

class Solution:

def twoSum(self, nums: List[int], target: int) -> List[int]:

dict = {}

l = len(nums)

for i in range(l):

n =nums[i]

if target-n not in dict:

dict[n]=i

else:

return [dict[target-n],i]

[……]阅读全文

Leetcode

2019-11-19

#1 Solution 1

1

2

3

4

5

6

7

class Solution:

def twoSum(self, nums: List[int], target: int) -> List[int]:

l = len(nums)

for i in range(l):

for j in range(i+1, l):

if nums[i]+nums[j] == target:

return [i, j]

[……]阅读全文

#3 Solution 1 [Best SE]

#2 Solution 1 [BEST SE]

#1 Solution 2 [Best TE]

#1 Solution 1

Good words