LeetCode学習帳

function twoSum(nums: number[], target: number): number[] {
  const map = new Map<number, number>();
  for (let i = 0; i < nums.length; i++) {
    const complement = target - nums[i];
    if (map.has(complement)) {
      return [map.get(complement)!, i];
    }
    map.set(nums[i], i);
  }
  return [];
}

function isPalindrome(x: number): boolean {
  if (x < 0) return false;
  const reverseX = Number(String(x).split("").reverse().join(""));
  return x === reverseX;
}