LeetCode (8) 썸네일형 리스트형 [Python] 238. Product of Array Except Self leetcode.com/problems/product-of-array-except-self/ Product of Array Except Self - LeetCode Level up your coding skills and quickly land a job. This is the best place to expand your knowledge and get prepared for your next interview. leetcode.com 풀이 from typing import * class Solution: def productExceptSelf(self, nums: List[int]) -> List[int]: result = [] p = 1 for i in range(0,len(nums)): resul.. [Python] 561. Array Partition I leetcode.com/problems/array-partition-i/ Array Partition I - LeetCode Level up your coding skills and quickly land a job. This is the best place to expand your knowledge and get prepared for your next interview. leetcode.com 풀이 from typing import * class Solution: def arrayPairSum(self, nums: List[int]) -> int: # 순서대로 나열을 해서 짝수번째 수만 더하면 됨 nums = sorted(nums) i, sum = 0, 0 print(nums) while i < l.. [Python] 15. Two Sum leetcode.com/problems/3sum/ 풀이 from typing import * class Solution: def threeSum(self, nums: List[int]) -> List[List[int]]: # 3개의 합이 0이 되는 숫자들의 쌍을 출력 # 합이 0이 되는것이 없거나, 3개의 합이 0이 되는게 없다면 빈리스트 출력 answer_list = [] nums = sorted(nums) #nums.sort()해봤으나 sorted(nums)가 더 빠름. # 원소의 개수가 3개 이하라면 바로 return if len(nums) < 3: return answer_list # 무조건 3개의 숫자를 사용해야하기 때문에 max i는 len(nums)-2임. for i in range(len(.. [Python] 1. Two Sum leetcode.com/problems/two-sum/ Two Sum - LeetCode Level up your coding skills and quickly land a job. This is the best place to expand your knowledge and get prepared for your next interview. leetcode.com 풀이 from typing import * class Solution: def twoSum(self, nums: List[int], target: int) -> List[int]: for i in range(len(nums)): j = i+1 while j < len(nums): if nums[i] + nums[j] == target: retu.. [Python] 819. Most Common Word leetcode.com/problems/most-common-word/ Most Common Word - LeetCode Level up your coding skills and quickly land a job. This is the best place to expand your knowledge and get prepared for your next interview. leetcode.com 풀이 class Solution: def mostCommonWord(self, paragraph: str, banned: List[str]) -> str: words = [word for word in re.sub(r'[^\w]', ' ', paragraph).lower().split() if word not i.. [Python] 937. Reorder Log Files leetcode.com/problems/reorder-data-in-log-files/ Reorder Data in Log Files - LeetCode Level up your coding skills and quickly land a job. This is the best place to expand your knowledge and get prepared for your next interview. leetcode.com 풀이 class Solution: def reorderLogFiles(self, logs: List[str]) -> List[str]: digits, letters = [], [] # 구분해서 리스트 넣기 for i in logs: if i.split()[1].isdigit(): .. [Python] 344. Reverse String leetcode.com/problems/reverse-string/ Reverse String - LeetCode Level up your coding skills and quickly land a job. This is the best place to expand your knowledge and get prepared for your next interview. leetcode.com 풀이 class Solution: def reverseString(self, s: List[str]) -> None: """ Do not return anything, modify s in-place instead. """ time = len(s)/2 count = 0 while time >= 1 : time -= 1 .. [Python] 125. Valid Palindrome https://leetcode.com/problems/valid-palindrome/ Valid Palindrome - LeetCode Level up your coding skills and quickly land a job. This is the best place to expand your knowledge and get prepared for your next interview. leetcode.com 풀이 from collections import deque class Solution: def isPalindrome(self, s: str) -> bool: # 소문자로 만들기 s = s.lower() # 문자를 넣을 deque strings = deque() # 소문자로 통일한 문장에서 영어, .. 이전 1 다음