자바스크립트에는 replaceAll이 없다. 따라서 정규식을 활용한다. function defangIPaddr(address: string): string { return address.replace(/\./gi, '[.]') }; g : 발생하는 모든 패턴에 대한 전역 검색 i : 대/소문자 구분 안함 배열로 변환해 처리할 수도 있다. map 함수는 원본 객체 배열을 변경하는 것이 아니라 새로운 객체 배열을 리턴해준다. function defangIPaddr(address: string): string { let addressArray = address.split('') addressArray = addressArray.map((c) => { if (c === '.') { return '[.]' } r..

48. Rotate Image 문제 You are given an n x n 2D matrix representing an image, rotate the image by 90 degrees (clockwise). You have to rotate the image in-place, which means you have to modify the input 2D matrix directly. DO NOT allocate another 2D matrix and do the rotation. 제한사항 n == matrix.length == matrix[i].length 1

18. 4Sum 문제 Given an array nums of n integers, return an array of all the unique quadruplets [nums[a], nums[b], nums[c], nums[d]] such that: 0

16. 3Sum Closest 문제 Given an integer array nums of length n and an integer target, find three integers in nums such that the sum is closest to target. Return the sum of the three integers. You may assume that each input would have exactly one solution taget에 가장 가까운 세 수의 합 찾기 제한사항 3

15. 3Sum 문제 Given an integer array nums, return all the triplets [nums[i], nums[j], nums[k]] such that i != j, i != k, and j != k, and nums[i] + nums[j] + nums[k] == 0. Notice that the solution set must not contain duplicate triplets. 제한사항 0 List[List[int]]: nums.sort() answer = [] for i in range(len(nums) - 2): if i > 0 and nums[i] == nums[i - 1]: # 이미 체크한 값이면 패스 continue l, r = i + 1, len(nums..

494. Target Sum 문제 You are given an integer array nums and an integer target. You want to build an expression out of nums by adding one of the symbols '+' and '-' before each integer in nums and then concatenate all the integers. For example, if nums = [2, 1], you can add a '+' before 2 and a '-' before 1 and concatenate them to build the expression "+2-1". Return the number of different express..

1. Two Sum 문제 Given an array of integers nums and an integer target, return indices of the two numbers such that they add up to target. You may assume that each input would have *exactly* one solution, and you may not use the same element twice. You can return the answer in any order. 제한사항 1

287. Find the Duplicate Number 문제 Given an array of integers nums containing n + 1 integers where each integer is in the range [1, n] inclusive. There is only one repeated number in nums, return this repeated number. You must solve the problem without modifying the array nums and uses only constant extra space. [1, n] 까지의 숫자가 들어 있는 배열에 추가로 하나의 숫자가 들어 갔을 때 추가된 숫자 찾기 제한사항 1 int: n = len(nums) - 1 ..