Data Scientist Data Scientist

전체 글

• [Python] max 함수에서 key 값 사용하기

  Implementation/Python 2021. 10. 27. 15:11

  # 아래와 같이 리스트가 주어졌을 때, A = [2,9,4,3,10,11] >>> max(A) 11 >>> max(A, key=lambda x: x % 2) 9 # x % 2 의 결과값이 동일한 변수가 여러개 존재할 경우, 가장 첫 번째 변수를 가져왔다. >>> max(A, key=lambda x: x // 2) 10

  Read More
• [Python] tuple(index, key) in list

  Implementation/Python 2021. 10. 27. 15:04

  A = [3,4,2,2] # index 와 value 를 tuple 형태로 저장 A_with_index = [ (idx,i) for idx, i in enumerate(A) ] # list comprehension 응용 => index 와 value 값 자리 바꾸기 A_with_index= [ (i, idx) for idx, i in enumerate(A) ]

  Read More
• [LeetCode] [DP] 118. Pascal's Triangle

  Algorithm/LeetCode 2021. 10. 25. 13:09

  118. Pascal's Triangle Given an integer numRows, return the first numRows of Pascal's triangle. In Pascal's triangle, each number is the sum of the two numbers directly above it as shown: Example 1: Input: numRows = 5 Output: [[1],[1,1],[1,2,1],[1,3,3,1],[1,4,6,4,1]] Example 2: Input: numRows = 1 Output: [[1]] class Solution: def generate(self, numRows: int) -> List[List[int]]: if numRows == 1: ..

  Read More
• [LeetCode] [DP] 70. Climbing Stairs

  카테고리 없음 2021. 10. 8. 10:57

  You are climbing a staircase. It takes n steps to reach the top. Each time you can either climb 1 or 2 steps. In how many distinct ways can you climb to the top? Example 1: Input: n = 2 Output: 2 Explanation: There are two ways to climb to the top. 1. 1 step + 1 step 2. 2 steps Example 2: Input: n = 3 Output: 3 Explanation: There are three ways to climb to the top. 1. 1 step + 1 step + 1 step 2...

  Read More