Skip to content

Commit 2c2c8d2

Browse files
committed
line-lint
1 parent 1c9ecfd commit 2c2c8d2

File tree

4 files changed

+4
-4
lines changed

4 files changed

+4
-4
lines changed

contains-duplicate/Sung-Heon.py

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -6,4 +6,4 @@ def containsDuplicate(self, nums: List[int]) -> bool:
66
return True
77
else:
88
temp[i] = True
9-
return False
9+
return False

house-robber/Sung-Heon.py

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -12,4 +12,4 @@ def rob(self, nums: List[int]) -> int:
1212
for i in range(2, len(nums)):
1313
dp[i] = max(dp[i - 2] + nums[i], dp[i - 1])
1414

15-
return dp[-1]
15+
return dp[-1]

longest-consecutive-sequence/Sung-Heon.py

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -18,4 +18,4 @@ def longestConsecutive(self, nums: List[int]) -> int:
1818
current += 1
1919
longest = max(longest, current_streak)
2020

21-
return longest
21+
return longest

top-k-frequent-elements/Sung-Heon.py

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -6,4 +6,4 @@ def topKFrequent(self, nums: List[int], k: int) -> List[int]:
66
temp[i] += 1
77
else:
88
temp[i] = 1
9-
return [key for key, value in sorted(temp.items(), key=lambda x: x[1],reverse=True)][:k]
9+
return [key for key, value in sorted(temp.items(), key=lambda x: x[1], reverse=True)][:k]

0 commit comments

Comments
 (0)