[LeetCode] 100. Same Tree
Python # Definition for a binary tree node. # class TreeNode: # def __init__(self, val=0, left=None, right=None): # self.val = val # self...
Category
LeetCode
[LeetCode] 350. Intersection of Two Arrays II
Python class Solution: def intersect(self, nums1: List[int], nums2: List[int]) -> List[int]: answer = [] for i in nums1: i...
[LeetCode] 36. Valid Sudoku
Python class Solution: def isValidSudoku(self, board: List[List[str]]) -> bool: for i in range(len(board)): row = [] c...
[LeetCode] 81. Search in Rotated Sorted Array II
Python class Solution: def search(self, nums: List[int], target: int) -> bool: if target in nums: return True else: ...
[LeetCode] 74. Search a 2D Matrix
Python class Solution: def searchMatrix(self, matrix: List[List[int]], target: int) -> bool: for i in matrix: if target in i: ...
[LeetCode] 34. Find First and Last Position of Element in Sorted Array
Python class Solution: def searchRange(self, nums: List[int], target: int) -> List[int]: answer = [] for i in range(len(nums)): ...
[LeetCode] 349. Intersection of Two Arrays
Python class Solution: def intersection(self, nums1: List[int], nums2: List[int]) -> List[int]: answer = [] num1, num2 = set(nums1), s...
[LeetCode] 268. Missing Number
Python class Solution: def missingNumber(self, nums: List[int]) -> int: temp = 0 for i in sorted(nums): if i != temp: ...
[LeetCode] 242. Valid Anagram
Python class Solution: def isAnagram(self, s: str, t: str) -> bool: if sorted(s) == sorted(t): return True else: ...
[LeetCode] 292. Nim Game
Python class Solution: def canWinNim(self, n: int) -> bool: if n % 4 == 0: return False else: return True
[LeetCode] 144. Binary Tree Preorder Traversal
Python # Definition for a binary tree node. # class TreeNode: # def __init__(self, val=0, left=None, right=None): # self.val = val # self...
[LeetCode] 206. Reverse Linked List
Python # Definition for singly-linked list. # class ListNode: # def __init__(self, val=0, next=None): # self.val = val # self.next = next...
[LeetCode] 258. Add Digits
Python class Solution: def addDigits(self, num: int) -> int: while len(str(num)) > 1: num = sum(list(map(int, list(str(num)...
[LeetCode] 709. To Lower Case
Python class Solution: def toLowerCase(self, s: str) -> str: return s.lower()
[LeetCode] 83. Remove Duplicates from Sorted List
Python # Definition for singly-linked list. # class ListNode: # def __init__(self, val=0, next=None): # self.val = val # self.next = next...
[LeetCode] 2129. Capitalize the Title
Python class Solution: def capitalizeTitle(self, title: str) -> str: answer = [] title = title.lower() temp = title.split() ...
[LeetCode] 507. Perfect Number
Python class Solution: def detectCapitalUse(self, word: str) -> bool: if word.upper() == word or word.lower() == word: return True...
[LeetCode] 507. Perfect Number
Python class Solution: def checkPerfectNumber(self, num: int) -> bool: if num < 2: return False answer = 1 for ...
[LeetCode] 219. Contains Duplicate II
Python class Solution: def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool: if len(nums) == len(set(nums)): return ...
[LeetCode] 287. Find the Duplicate Number
Python class Solution: def findDuplicate(self, nums: List[int]) -> int: temp = Counter(nums) for i, v in temp.items(): if ...
[LeetCode] 33. Search in Rotated Sorted Array
Python class Solution: def search(self, nums: List[int], target: int) -> int: if target in nums: return nums.index(target) ...
[LeetCode] 217. Contains Duplicate
Python class Solution: def containsDuplicate(self, nums: List[int]) -> bool: if len(nums) == len(set(nums)): return False ...
[LeetCode] 70. Climbing Stairs
Python class Solution: @lru_cache def climbStairs(self, n: int) -> int: if n == 0 or n == 1: return 1 return...
[LeetCode] 509. Fibonacci Number
Python class Solution: def fib(self, n: int) -> int: a, b = 0, 1 for i in range(n): a, b = a + b, a r...
[LeetCode] 121. Best Time to Buy and Sell Stock
Python class Solution: def maxProfit(self, prices: List[int]) -> int: answer = 0 num = sys.maxsize for price in prices: ...
[LeetCode] 53. Maximum Subarray
Python class Solution: def maxSubArray(self, nums: List[int]) -> int: answer = -sys.maxsize sum_num = 0 for num in nums: ...
[LeetCode] 231. Power of Two
Python class Solution: def isPowerOfTwo(self, n: int) -> bool: if n == 0: return False while n != 1: if n % 2 ...
[LeetCode] 326. Power of Three
Python class Solution: def isPowerOfThree(self, n: int) -> bool: if n == 0: return False while n != 1: if n % ...
[LeetCode] 2351. First Letter to Appear Twice
Python class Solution: def repeatedCharacter(self, s: str) -> str: temp = {} for i in s: if i not in temp: ...
[LeetCode] 387. First Unique Character in a String
Python class Solution: def firstUniqChar(self, s: str) -> int: temp = Counter(s) for i in range(len(s)): if temp[s[i]] == ...
[LeetCode] 412. Fizz Buzz
Python class Solution: def fizzBuzz(self, n: int) -> List[str]: answer = [] for i in range(1, n + 1): if i % 3 == 0 and i ...
[LeetCode] 367. Valid Perfect Square
Python class Solution: def isPerfectSquare(self, num: int) -> bool: if num ** 0.5 == int(num ** 0.5): return True else: ...
[LeetCode] 69. Sqrt(x)
Python class Solution: def mySqrt(self, x: int) -> int: return int(math.sqrt(x))
[LeetCode] 11. Container With Most Water
Python class Solution: def maxArea(self, height: List[int]) -> int: answer = 0 left = 0 right = len(height) - 1 while ...
[LeetCode] 88. Merge Sorted Array
Python class Solution: def merge(self, nums1: List[int], m: int, nums2: List[int], n: int) -> None: """ Do not return anything, modify...
[LeetCode] 476. Number Complement
Python class Solution: def findComplement(self, num: int) -> int: binary = bin(num)[2:] answer = '' for i in binary: ...
[LeetCode] 191. Number of 1 Bits
Python class Solution: def hammingWeight(self, n: int) -> int: return bin(n).count('1')
[LeetCode] 448. Find All Numbers Disappeared in an Array
Python class Solution: def findDisappearedNumbers(self, nums: List[int]) -> List[int]: return set(range(1, len(nums) + 1)) - set(nums)
[LeetCode] 50. Pow(x, n)
Python class Solution: def myPow(self, x: float, n: int) -> float: return pow(x, n)
[LeetCode] 43. Multiply Strings
Python class Solution: def multiply(self, num1: str, num2: str) -> str: return str(int(num1) * int(num2))
[LeetCode] 1859. Sorting the Sentence
Python class Solution: def sortSentence(self, s: str) -> str: answer = '' temp = s.split() word = {} for i in ...
[LeetCode] 1678. Goal Parser Interpretation
Python class Solution: def interpret(self, command: str) -> str: return command.replace("()", "o").replace("(al)", "al")
[LeetCode] 1365. How Many Numbers Are Smaller Than the Current Number
Python class Solution: def smallerNumbersThanCurrent(self, nums: List[int]) -> List[int]: answer = [] for num in nums: tem...
[LeetCode] 1281. Subtract the Product and Sum of Digits of an Integer
Python class Solution: def subtractProductAndSum(self, n: int) -> int: temp = list(map(int, ' '.join(str(n)).split())) product_of_digi...
[LeetCode] 105. Construct Binary Tree from Preorder and Inorder Traversal
Python ~~~python Definition for a binary tree node. class TreeNode: def init(self, val=0, left=None, right=None): self.val = val self.left = left self.right ...
[LeetCode] 102. Binary Tree Level Order Traversal
Python # Definition for a binary tree node. # class TreeNode: # def __init__(self, val=0, left=None, right=None): # self.val = val # self...
[LeetCode] 6. Zigzag Conversion
Python ~~~python class Solution: def convert(self, s: str, numRows: int) -> str: if len(s) <= numRows or numRows < 2: return...
[LeetCode] 199. Binary Tree Right Side View
Python # Definition for a binary tree node. # class TreeNode: # def __init__(self, val=0, left=None, right=None): # self.val = val # self...
[LeetCode] 28. Implement strStr()
Python class Solution: def strStr(self, haystack: str, needle: str) -> int: if len(needle) == 0 : return 0 else : ...
[LeetCode] 67. Add Binary
Python class Solution: def addBinary(self, a: str, b: str) -> str: return format(int(a, 2) + int(b, 2), 'b')
[LeetCode] 12. Integer to Roman
Python class Solution: def intToRoman(self, num: int) -> str: number = [1, 4, 5, 9, 10, 40, 50, 90, 100, 400, 500, 900, 1000] symbol =...
[LeetCode] 27. Remove Element
Python class Solution: def removeElement(self, nums: List[int], val: int) -> int: while nums.count(val): nums.remove(val) ...
[LeetCode] 47. Permutations II
Python class Solution: def permuteUnique(self, nums: List[int]) -> List[List[int]]: return set(permutations(nums, len(nums)))
[LeetCode] 26. Remove Duplicates from Sorted Array
Python class Solution: def removeDuplicates(self, nums: List[int]) -> int: before = 0 for current in range(1, len(nums)): ...
[LeetCode] 46. Permutations
Python class Solution: def permute(self, nums: List[int]) -> List[List[int]]: return list(permutations(nums, len(nums)))
[LeetCode] 16. 3Sum Closest
Python class Solution: def threeSumClosest(self, nums: List[int], target: int) -> int: sorted_nums = sorted(nums) answer = sorted_nums...
[LeetCode] 7. Reverse Integer
Python class Solution: def reverse(self, x: int) -> int: if x > 0: answer = int(str(x)[::-1]) else: answer ...
[LeetCode] 4. Median of Two Sorted Arrays
Python class Solution: def findMedianSortedArrays(self, nums1: List[int], nums2: List[int]) -> float: nums = nums1 + nums2 nums.sort()...
[LeetCode] 3. Longest Substring Without Repeating Characters
Python class Solution: def lengthOfLongestSubstring(self, s: str) -> int: answer = 0 temps = [] for i in s: if i i...
[LeetCode] 2. Add Two Numbers
Python # Definition for singly-linked list. # class ListNode: # def __init__(self, val=0, next=None): # self.val = val # self.next = next...
[LeetCode] 680. Valid Palindrome II
Python class Solution: def validPalindrome(self, s: str) -> bool: left, right = 0, len(s) - 1 while left < right: if(s[...
[LeetCode] 58. Length of Last Word
Python class Solution: def lengthOfLastWord(self, s: str) -> int: temps = s.split() return len(temps[-1])
[LeetCode] 665. Non-decreasing Array
Python class Solution: def checkPossibility(self, nums: List[int]) -> bool: count = 0 for i in range(1, len(nums)): if num...
[LeetCode] 859. Buddy Strings
Python class Solution: def buddyStrings(self, s: str, goal: str) -> bool: count = 0 if len(s) != len(goal) or sorted(s) != sorted(goal...
[LeetCode] 1689. Partitioning Into Minimum Number Of Deci-Binary Numbers
Python class Solution: def minPartitions(self, n: str) -> int: return max(n)
[LeetCode] 1431. Kids With the Greatest Number of Candies
Python class Solution: def kidsWithCandies(self, candies: List[int], extraCandies: int) -> List[bool]: temp = max(candies) answer = []...
[LeetCode] 1512. Number of Good Pairs
Python class Solution: def numIdenticalPairs(self, nums: List[int]) -> int: answer = 0 for i in range(len(nums)): for j in...
[LeetCode] 771. Jewels and Stones
Python class Solution: def numJewelsInStones(self, jewels: str, stones: str) -> int: answer = 0 for stone in stones: if st...
[LeetCode] 2114. Maximum Number of Words Found in Sentences
Python class Solution: def mostWordsFound(self, sentences: List[str]) -> int: answer = -sys.maxsize for sentence in sentences: ...
[LeetCode] 1672. Richest Customer Wealth
Python class Solution: def maximumWealth(self, accounts: List[List[int]]) -> int: answer = -sys.maxsize for account in accounts: ...
[LeetCode] 1108. Defanging an IP Address
Python class Solution: def defangIPaddr(self, address: str) -> str: temp = address.split(".") return "[.]".join(temp)
[LeetCode] 2011. Final Value of Variable After Performing Operations
Python class Solution: def finalValueAfterOperations(self, operations: List[str]) -> int: answer = 0 for operation in operations: ...
[LeetCode] 2236. Root Equals Sum of Children
Python # Definition for a binary tree node. # class TreeNode: # def __init__(self, val=0, left=None, right=None): # self.val = val # self...
[LeetCode] 1929. Concatenation of Array
Python class Solution: def getConcatenation(self, nums: List[int]) -> List[int]: return nums + nums
[LeetCode] 1920. Build Array from Permutation
Python class Solution: def buildArray(self, nums: List[int]) -> List[int]: answer = [] for i in nums: answer.append(nums[i...
[LeetCode] 2235. Add Two Integers
Python class Solution: def sum(self, num1: int, num2: int) -> int: return num1 + num2
[LeetCode] 1480. Running Sum of 1d Array
Python class Solution: def runningSum(self, nums: List[int]) -> List[int]: answer = [] for i in range(len(nums)): answer.a...
[LeetCode] 1528. Shuffle String
Python class Solution: def restoreString(self, s: str, indices: List[int]) -> str: answer = list(s) index = 0 for i in indices...
[LeetCode] 136. Single Number
Python class Solution: def singleNumber(self, nums: List[int]) -> int: counter = collections.Counter(nums) for i, v in counter.items()...
[LeetCode] 167. Two Sum II - Input Array Is Sorted
Python class Solution: def twoSum(self, numbers: List[int], target: int) -> List[int]: left = 0 right = len(numbers) - 1 while...
[LeetCode] 557. Reverse Words in a String III
Python class Solution: def reverseWords(self, s: str) -> str: temp = s.split() for i in range(len(temp)): temp[i] = temp[i...
[LeetCode] 283. Move Zeroes
Python class Solution: def moveZeroes(self, nums: List[int]) -> None: """ Do not return anything, modify nums in-place instead. ...
[LeetCode] 189. Rotate Array
Python class Solution: def rotate(self, nums: List[int], k: int) -> None: """ Do not return anything, modify nums in-place instead. ...
[LeetCode] 977. Squares of a Sorted Array
Python ~~~python class Solution: def sortedSquares(self, nums: List[int]) -> List[int]: answer = [] for i in nums: answer....
[LeetCode] 35. Search Insert Position
Python class Solution: def searchInsert(self, nums: List[int], target: int) -> int: left = 0 right = len(nums) - 1 while left ...
[LeetCode] 704. Binary Search
Python class Solution: def search(self, nums: List[int], target: int) -> int: index = bisect.bisect_left(nums, target) if index < ...
[LeetCode] 66. Plus One
Python class Solution: def plusOne(self, digits: List[int]) -> List[int]: digits = list(map(str, digits)) answer = int(''.join(digits)...
[LeetCode] 278. First Bad Version
Python ~~~python The isBadVersion API is already defined for you. def isBadVersion(version: int) -> bool:
[LeetCode] 9. Palindrome Number
Python class Solution: def isPalindrome(self, x: int) -> bool: if str(x) == str(x)[::-1]: return True else: re...
[LeetCode] 14. Longest Common Prefix
Python class Solution: def longestCommonPrefix(self, strs: List[str]) -> str: if not strs: return "" temp = min(strs, key=...
[LeetCode] 13. Roman to Integer
Python class Solution: def romanToInt(self, s: str) -> int: temps = { "I": 1, "V": 5, "X": 10, ...
[LeetCode] 234. Palindrome Linked List
Python # Definition for singly-linked list. # class ListNode: # def __init__(self, val=0, next=None): # self.val = val # self.next = next...
[LeetCode] 21. Merge Two Sorted Lists
Python # Definition for singly-linked list. # class ListNode: # def __init__(self, val=0, next=None): # self.val = val # self.next = next...
[LeetCode] 20. Valid Parentheses
Python class Solution: def isValid(self, s: str) -> bool: stack = [] table = { ')' : '(', '}' : '{', ...
[LeetCode] 561. Array Partition I
Python class Solution: def arrayPairSum(self, nums: List[int]) -> int: return sum(sorted(nums)[::2])
[LeetCode] 238. Product of Array Except Self
Python ~~~python class Solution: def productExceptSelf(self, nums: List[int]) -> List[int]: result = [] p = 1
[LeetCode] 15. 3Sum
Python ~~~python class Solution: def threeSum(self, nums: List[int]) -> List[List[int]]: result = [] nums.sort()
[LeetCode] 121. Best Time to Buy and Sell Stock
Python ~~~python class Solution: def maxProfit(self, prices: List[int]) -> int: profit = 0 min_price = sys.maxsize
[LeetCode] 819. Most Common Word
Python class Solution: def mostCommonWord(self, paragraph: str, banned: List[str]) -> str: words = [word for word in re.sub(r"[^\w]", ' ', par...
[LeetCode] 5. Longest Palindromic Substring
Python ~~~python class Solution: def longestPalindrome(self, s: str) -> str: def expand(left: int, right: int) -> str: while le...
[LeetCode] 49. Group Anagrams
Python class Solution: def groupAnagrams(self, strs: List[str]) -> List[List[str]]: anagrams = collections.defaultdict(list) for word ...
[LeetCode] 937. Reorder Data in Log Files
Python class Solution: def reorderLogFiles(self, logs: List[str]) -> List[str]: letters, digits = [], [] for log in logs: ...
[LeetCode] 344. Reverse String
Python class Solution: def reverseString(self, s: List[str]) -> None: s.reverse()
[LeetCode] 125. Valid Palindrome
Python ~~~python class Solution: def isPalindrome(self, s: str) -> bool: strs = [] for i in s: if i.isalnum(): ...
[LeetCode] 1. Two Sum
Python ~~~python class Solution: def twoSum(self, nums: List[int], target: int) -> List[int]: for i in range(0, len(nums)): for j ...
Programmers
[Programmers] 점프와 순간 이동
Python
[Programmers] 옹알이 (2)
Python
[Programmers] 명예의 전당 (1)
Python
[Programmers] 둘만의 암호
Python
[Programmers] 기사단원의 무기
Python
[Programmers] 숫자 짝꿍
Python
[Programmers] 푸드 파이트 대회
Python
[Programmers] 카드 뭉치
Python
[Programmers] 문자열 나누기
Python
[Programmers] 과일 장수
Python
[Programmers] 개인정보 수집 유효기간
Python
[Programmers] 가장 가까운 같은 글자
Python
[Programmers] 크기가 작은 부분문자열
Python
[Programmers] 바탕화면 정리
Python
[Programmers] 덧칠하기
Python
[Programmers] 공원 산책
Python
[Programmers] 공원 산책
Python
[Programmers] 54. Spiral Matrix
Python class Solution: def spiralOrder(self, matrix: List[List[int]]) -> List[int]: answer = [] while matrix: answer += ma...
[Programmers] 동물의 아이디와 이름
SQL SELECT ANIMAL_ID, NAME FROM ANIMAL_INS
[Programmers] 오랜 기간 보호한 동물(2)
SQL SELECT I.ANIMAL_ID, I.NAME FROM ANIMAL_INS AS I, ANIMAL_OUTS AS O WHERE I.ANIMAL_ID = O.ANIMAL_ID ORDER BY O.DATETIME - I.DATETIME DESC LIMIT 2
[Programmers] 최소직사각형
Python def solution(sizes): answer = 0 min_size, max_size = [], [] for size in sizes: min_size.append(min(size[0], size[1])) max_...
[Programmers] 중복 제거하기
SQL SELECT count(distinct name) FROM ANIMAL_INS WHERE NAME IS NOT NULL
[Programmers] 보호소에서 중성화한 동물
SQL SELECT I.ANIMAL_ID, I.ANIMAL_TYPE, I.NAME FROM ANIMAL_INS AS I JOIN ANIMAL_OUTS AS O WHERE I.ANIMAL_ID = O.ANIMAL_ID AND I.SEX_UPON_INTAKE != O.SEX_UPON_...
[Programmers] [카카오 인턴] 키패드 누르기
Python def solution(numbers, hand): answer = '' phone = {1:(0, 0), 2:(0, 1), 3:(0, 2), 4:(1, 0), 5:(1, 1), 6:(1, 2), 7:(2, ...
[Programmers] 어린 동물 찾기
SQL SELECT ANIMAL_ID, NAME FROM ANIMAL_INS WHERE INTAKE_CONDITION != "Aged"
[Programmers] H-Index
Python def solution(citations): citations.sort() for i in range(len(citations)): if citations[i] >= len(citations) - i: return...
[Programmers] n^2 배열 자르기
Python ~~~python def solution(n, left, right): answer = [] for i in range(left, right+1): answer.append(max(divmod(i, n)) + 1)
[Programmers] 예상 대진표
Python ~~~python def solution(n,a,b): answer = 0 while a != b: answer += 1 a, b = (a + 1) // 2, (b + 1) // 2
[Programmers] 가장 큰 수
Python def solution(numbers): number = list(map(str, numbers)) number.sort(key = lambda x : x * 3, reverse = True) return str(int(''.join(nu...
[Programmers] 큰 수 만들기
Python def solution(number, k): answer = [] for i in number: while k > 0 and answer and answer[-1] < i: answer.pop() ...
[Programmers] 멀리 뛰기
Python def solution(n): a, b = 0, 1 for i in range(0, n): a, b = b, a + b return b % 1234567
[Programmers] 스킬트리
Python def solution(skill, skill_trees): answer = 0 for skills in skill_trees: temp = list(skill) boolean = True for j in ski...
[Programmers] 더 맵게
Python import heapq def solution(scoville, K): answer = 0 heapq.heapify(scoville) while scoville[0] < K: temp = heapq.heappop(scoville...
[Programmers] 괄호 회전하기
Python import collections def solution(s): answer = 0 q: deque = collections.deque(s) table = { ')' : '(', '}' : '{', ...
[Programmers] 올바른 괄호
Python def solution(s): temp = [] for i in s: if not temp: temp.append(i) elif temp[-1] == '(' and i == ')': ...
[Programmers] 피보나치 수
Python ~~~python def solution(n): answer = [] for i in range(0, n+1): if i == 0: answer.append(0) elif i == 1: ...
[Programmers] 피로도
Python from itertools import permutations def solution(k, dungeons): answer = 0 for dungeon in permutations(dungeons): num = k count ...
[Programmers] 줄 서는 방법
Python import math def solution(n, k): answer = [] temps = list(range(1, n + 1)) k -= 1 for i in range(n, 0, -1): div, k = divmod(k, ...
[Programmers] 짝지어 제거하기
Python def solution(s): temp = [] for i in range(len(s)): if len(temp) == 0: temp.append(s[i]) elif s[i] == temp[-1]: ...
[Programmers] 시저 암호
Python ~~~python def solution(s, n): s = list(s) for i in range(len(s)): if s[i].isupper(): s[i] = chr((ord(s[i]) - ord(‘A’) + n)...
[Programmers] 피보나치 수
Python def solution(n): a, b = 0, 1 for i in range(n): a, b = b, a + b return a
[Programmers] 튜플
Python def solution(s): answer = [] temp = sorted([s.split(',') for s in s[2:-2].split('},{')], key = len) for i in temp: for j in i: ...
[Programmers] 행렬의 곱셈
Python def solution(arr1, arr2): answer = [] for i in range(len(arr1)): list = [] for j in range(len(arr2[0])): temp = 0 ...
[Programmers] N개의 최소공배수
Python import math def solution(arr): answer = arr[0] for i in range(1, len(arr)): answer = (answer * arr[i]) // math.gcd(answer, arr[i]) ...
[Programmers] 최댓값과 최솟값
Python def solution(s): arr = list(map(int, s.split(' '))) return str(min(arr)) + " " + str(max(arr))
[Programmers] 숫자의 표현
Python def solution(n): answer = 0 for i in range(1, n + 1): sum = 0 for j in range(i, n + 1): sum += j if su...
[Programmers] K번째수
Python def solution(array, commands): answer = [] for command in commands: temp = sorted(array[command[0] - 1:command[1]]) answer.app...
[Programmers] 내적
Python def solution(a, b): answer = 0 for i in range(len(a)): answer += a[i] * b[i] return answer
[Programmers] 부족한 금액 계산하기
Python def solution(price, money, count): answer = 0 for i in range(1, count + 1): answer += price * i if answer - money >= 0...
[Programmers] 3진법 뒤집기
Python ~~~python def solution(n): answer = ‘’
[Programmers] 크레인 인형뽑기 게임
Python def solution(board, moves): answer = 0 temp = [] for i in moves: for j in board: if j[i - 1] != 0: if ...
[Programmers] 음양 더하기
Python def solution(absolutes, signs): answer = 0 for i in range(len(signs)): if signs[i] == True: answer += absolutes[i] ...
[Programmers] 없는 숫자 더하기
Python def solution(numbers): answer = 0 temp = [0,1,2,3,4,5,6,7,8,9] for i in temp: if i not in numbers: answer += i ...
[Programmers] 신규 아이디 추천
Python import re def solution(new_id): answer = new_id.lower() answer = re.sub('[^a-z0-9-_.]', '',answer) answer = re.sub('[\.]+', '.', answer) ...
[Programmers] 로또의 최고 순위와 최저 순위
Python def solution(lottos, win_nums): answer = [6,6,5,4,3,2,1] count = 0 count_zero = 0 for i in lottos: if i in win_nums: ...
[Programmers] 신고 결과 받기
Python import collections def solution(id_list, report, k): answer = [0] * len(id_list) temps = collections.defaultdict(list) count_report = coll...
[Programmers] 숫자 문자열과 영단어
Python def solution(s): temp = ['zero', 'one', 'two', 'three', 'four', 'five', 'six', 'seven', 'eight', 'nine'] for i in temp: s = s.replace(...
[Programmers] 문자열 내림차순으로 배치하기
Python def solution(s): answer = "".join(sorted(s, reverse = True)) return answer
[Programmers] 문자열 내 마음대로 정렬하기
Python def solution(strings, n): return sorted(strings, key = lambda x : (x[n], x))
[Programmers] 문자열 내 p와 y의 개수
Python def solution(s): if s.lower().count('p') == 0 and s.lower().count('y') == 0: return True if s.lower().count('p') == s.lower().cou...
[Programmers] 두 정수 사이의 합
Python def solution(a, b): if a < b : return sum(list(range(a, b + 1))) else: return sum(list(range(b, a + 1)))
[Programmers] 나머지가 1이 되는 수 찾기
Python def solution(n): for i in range(1, n): if n % i == 1: return i
[Programmers] 나누어 떨어지는 숫자 배열
Python def solution(arr, divisor): answer = [] for i in arr: if i % divisor == 0: answer.append(i) if answer: return ...
[Programmers] 같은 숫자는 싫어
Python def solution(arr): answer = [] for i in range(len(arr)): if i == 0: answer.append(arr[i]) elif arr[i] != arr[i-1]:...
[Programmers] 소수 찾기
Python ~~~python def solution(n): num = set(range(2, n + 1))
[Programmers] 가운데 글자 가져오기
Python def solution(s): if len(s) % 2 != 0: return s[int(len(s)/2)] else: return s[int(len(s)/2) - 1:int(len(s)/2) + 1]
[Programmers] 수박수박수박수박수박수?
Python def solution(n): answer = '' for i in range(n): if i % 2 == 0: answer += '수' else: answer += '박' ...
[Programmers] 서울에서 김서방 찾기
Python def solution(seoul): for i in range(len(seoul)): if seoul[i] == 'Kim': return f'김서방은 {i}에 있다'
[Programmers] 문자열 다루기 기본
Python def solution(s): if (len(s) == 4 or len(s) == 6) and s.isdigit(): return True else: return False
[Programmers] 자릿수 더하기
Python ~~~python def solution(n): temp = list(str(n)) answer = list(map(int, temp))
[Programmers] 이상한 문자 만들기
Python def solution(s): answer = '' temps = s.split(' ') for temp in temps: for i in range(len(temp)): if i % 2 == 0: ...
[Programmers] 약수의 합
Python def solution(n): answer = 0 for i in range(1, n + 1): if n % i == 0: answer += i return answer
[Programmers] 문자열을 정수로 바꾸기
Python def solution(s): return int(s)
[Programmers] 정수 제곱근 판별
Python import math def solution(n): if math.sqrt(n) == int(math.sqrt(n)): return (math.sqrt(n) + 1) ** 2 return -1
[Programmers] 정수 내림차순으로 배치하기
Python def solution(n): temp = list(str(n)) temp.sort(reverse = True) return int("".join(temp))
[Programmers] 자연수 뒤집어 배열로 만들기
Python def solution(n): answer = list(str(n)) answer.reverse() return list(map(int, answer))
[Programmers] 최대공약수와 최소공배수
Python import math def solution(n, m): answer = [math.gcd(n, m), ((n * m) // math.gcd(n, m))] return answer
[Programmers] 짝수와 홀수
Python def solution(num): answer = '' if num % 2 == 0: return 'Even' else: return 'Odd'
[Programmers] 제일 작은 수 제거하기
Python def solution(arr): if len(arr) == 1: return [-1] else: arr.remove(min(arr)) return arr
[Programmers] 행렬의 덧셈
Python def solution(arr1, arr2): answer = [] for i in range(len(arr1)): arr = [] for j in range(len(arr1[0])): arr.append...
[Programmers] 핸드폰 번호 가리기
Python ~~~python def solution(phone_number): answer = ‘*’ * (len(phone_number) - 4) + phone_number[-4:]
[Programmers] 하샤드 수
Python def solution(x): arr = list(str(x)) sum= 0 for i in arr: sum += int(i) if x % sum == 0: return True ...
[Programmers] 콜라츠 추측
Python def solution(num): answer = 0 while num != 1: answer += 1 if answer == 500: return -1 if num % 2 == 0: ...
[Programmers] 구명보트
Python def solution(people, limit): answer = 0 start = 0 end = len(people) - 1 people.sort() while start <= end: answer += 1 ...
[Programmers] 카펫 (완전탐색)
Python def solution(brown, yellow): total = brown + yellow for weight in range(total, 2, -1): if total % weight == 0: height = to...
[Programmers] 체육복
Python def solution(n, lost, reserve): set_reserve = set(reserve) - set(lost) set_lost = set(lost) - set(reserve) for i in set_reserve: i...
[Programmers] 주식가격
Python import collections def solution(prices): answer = [] q: deque = collections.deque(prices) while q: count = 0 temp = q.popl...
[Programmers] 소수 찾기 (완전탐색)
Python from itertools import permutations def is_prime_number(a): if(a<2): return False for i in range(2,a): if(a%i==0): ...
[Programmers] 모의고사 (완전탐색)
Python def solution(answers): result = [] one = [1, 2, 3, 4, 5] two = [2, 1, 2, 3, 2, 4, 2, 5] three = [3, 3, 1, 1, 2, 2, 4, 4, 5, 5] tem...
[Programmers] 다리를 지나는 트럭
Python def solution(bridge_length, weight, truck_weights): answer = 0 q = [0] * bridge_length while q: answer += 1 q.pop(0) ...
[Programmers] 프린터
Python import collections def solution(priorities, location): answer = 0 q: deque = collections.deque([(v, i) for i, v in enumerate(priorities)]) ...
[Programmers] 기능개발
Python def solution(progresses, speeds): answer = [] day = 0 count = 0 while len(progresses) > 0: if progresses[0] + speeds[0...
[Programmers] x만큼 간격이 있는 n개의 숫자
Python def solution(x, n): sum = 0 answer = [] for i in range(n): sum += x answer.append(sum) return answer
[Programmers] 직사각형 별찍기
Python a, b = map(int, input().strip().split(' ')) for i in range(b): for j in range(a): print('*', end='') print();
[Programmers] 평균 구하기
Python def solution(arr): answer = sum(arr) / len(arr) return answer
Python
[Python] 파이썬이 느린 이유
1. 파이썬은 동적 타입 언어 파이썬은 동적 타입 언어(Dynamically Typed Language)이다: 정적 타입 언어인 C나 자바와 달리 원시 타입인 string, boolean, int 등을 선언할 필요가 없다. 하지만 선언을 하지 않은 만큼 컴퓨터는 할 일이 늘어난다....
[Python] Django
1. Django란? Djano란 웹사이트를 신속하게 개발하는 하도록 도움을 주는 파이썬 웹 프레임워크입니다.
[Python] sys.modules, sys.path
1. sys.module
[Python]함수의 인자 형태와 순서
1. Positional arguments 가장 기본적인 형태는 순서대로 값이 parameter로 함수에 전해지는 경우입니다.
[Python] basic
1. Print
Git & GitHub
[Git & GitHub] Commit 수정
1. 마지막 커밋을 수정하기 마지막 커밋을 수정하려면 아래 명령어를 치면 된다 git commit --amend
[Git & GitHub] GitHub
1. Github 란 GitHub은 Git repository를 위한 호스팅 플랫폼입니다.
[Git & GitHub] Git command
1. Initializing a repository git init 이 명령어는 프로젝트 폴더 내에 숨겨진 .git 디렉토리를 생성하고 이 Git은 현재 저장소에 대한 모든 변경사항을 추적/관리하게 됩니다.
[Git & GitHub] Git
1. git 이란
CSS
[CSS] Display
block block 속성은 inline 과는 달리 한 줄에 나열되지 않고 그 자체로 한 줄을 완전히 차지한다. block 속성을 가지고 있는 태그는 기본적으로 너비 100%(width: 100%)속성을 가지고 있다. +화면의 가로 폭을 100%로 완전히 차지하기 때문...
[CSS] position
position 속성 static : position 속성을 부여하지 않았을 때 가지는 디폴드 값. relative : 현재 위치에서 상대적인 offset 속성을 줄 수 있다. absolute : 부모 중에 static이 아닌 요소의 위치를 기준으로 상대적인 offset 속성을...
HTTP
[HTTP] HTTP
1. HTTP HTTP는 Hyper Text Transfer Protocol로 컴퓨터들끼리 HTML파일을 주고받을 수 있도록 하는 소통방식 또는 약속이다.
[HTTP] Status Code
1. 200: OK 가장 자주 보게되는 Status Code 문제없이 요청에 대한 처리가 백엔드 서버에서 이루어지고 나서 오는 응답코드