LeetCode :Roman to Integer
문제 Roman numerals are represented by seven different symbols: I, V, X, L, C, D and M.
문제 Roman numerals are represented by seven different symbols: I, V, X, L, C, D and M.
문제 Given an integer x, return true if x is palindrome integer.
문제 Given a signed 32-bit integer x, return x with its digits reversed. If reversing x causes the value to go outside the signed 32-bit integer range [-231, ...
문제설명 Given an array of integers nums and an integer target, return indices of the two numbers such that they add up to target.
문제 배열 array의 i번째 숫자부터 j번째 숫자까지 자르고 정렬했을 때, k번째에 있는 수를 구하려 합니다.