Outgoing Introvert

× Dynamic Programming, Divide and Conquer | Medium LeetCode 53. Maximum Subarray for문 중첩해서 돌려서 O(n^2) 으로 풀었더니 당연히 시간초과 뜸,, Time Limit Exceeded 더보기 subarray 하나씩 더해가면서 값 저장하는 방식,, let solution = Solution() print(solution.maxSubArray([-2,1,-3,4,-1,2,1,-5,4])) //6 print(solution.maxSubArray([-2])) //-2 print(solution.maxSubArray([1])) //1 class Solution { func maxSubArray(_ nums: [Int]) -> Int { if ..

○Math, Dynamic Programming, Memoization | EasyLeetCode 70. Climbing Stairs내 답안. 배열에 저장class Solution { func climbStairs(_ n: Int) -> Int { if n == 1 || n == 2 { return n } var result = [1,2] for i in 2..다른 답안. 변수 두 개 그냥 계속 업데이트 해주는 방법class Solution { func climbStairs(_ n: Int) -> Int { var (first, second) = (1, 1) for _ in 1.. ** 딱히 차이는 없겠..

○ Dynamic Programming | Easy 119. Pascal's Triangle II class Solution { func getRow(_ rowIndex: Int) -> [Int] { var row = [1] if rowIndex == 0 { return row } for i in 1...rowIndex { var newRow = Array(repeating: 1, count: i + 1) for j in 1..

○ Dynamic Programming | Easy 118. Pascal's Triangle 제출 답안 30분 append([1]) 해주고 더한 값들 append 해주고 마지막에 append 1 해주는 방법 class Solution { func generate(_ numRows: Int) -> [[Int]] { var result = [[1]] for i in 1..

× 그리디? Medium You are given two positive integers n and target. An integer is considered beautiful if the sum of its digits is less than or equal to target. Return the minimum non-negative integer x such that n + x is beautiful. The input will be generated such that it is always possible to make n beautiful. Constraints: - 1 Int { var array = String(n).map({ Int(String($0))! }) var sum = array.r..