프로그래머스
function solution(s) {
let words = s.split(' ');
let result = Array();
for (let i = 0; i < words.length; i++) {
result.push(words[i].split('').map((current, j) => j % 2 ? current.toLowerCase() : current.toUpperCase()).join(''));
}
return result.join(' ');
}
def solution(n, arr1, arr2):
result = list()
for i in range(n):
result.append(bin(arr1[i] | arr2[i])[2:].zfill(n).replace('1', '#').replace('0', ' '))
return result
리트코드
class Solution:
def rob(self, nums: List[int]) -> int:
if len(nums) == 1:
return nums[0]
elif len(nums) == 2:
return max(nums)
elif len(nums) == 3:
if nums[0] + nums[2] > nums[1]:
return nums[0] + nums[2]
dp = [0] * len(nums)
dp[0] = nums[0]
dp[1] = nums[1]
dp[2] = nums[0] + nums[2]
for i in range(3, len(nums)):
dp[i] = max(dp[i - 2], dp[i - 3]) + nums[i]
return max(dp)
하루를 마치고