본문 바로가기
반응형

Software Development/Leetcode33

Leetcode 1. Two Sum 릿코드 1번문제 Two Sum 문제 풀이 안녕하세요! 오늘은 투썸 문제를 풀어보도록 하겠습니다. Easy 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. Example 1: Input: nums = [2,7,11,15], target = 9 Output: [0,1] Explan.. 2023. 1. 12.
Leetcode 242. Valid Anagram 242. Valid Anagram Easy Given two strings s and t, return true if t is an anagram of s, and false otherwise. An Anagram is a word or phrase formed by rearranging the letters of a different word or phrase, typically using all the original letters exactly once. Example 1: Input: s = "anagram", t = "nagaram" Output: true Example 2: Input: s = "rat", t = "car" Output: false Constraints: 1 2023. 1. 12.
Leetcode 217. Contains Duplicate 217. Contains Duplicate Given an integer array nums, return true if any value appears at least twice in the array, and return false if every element is distinct. Example 1: Input: nums = [1,2,3,1] Output: true Example 2: Input: nums = [1,2,3,4] Output: false Example 3: Input: nums = [1,1,1,3,3,4,3,2,4,2] Output: true Constraints: 1 2023. 1. 11.
반응형

티스토리툴바