Isomorphic Strings
LeetCode 205. Isomorphic Strings 원문 Given two strings s and t, determine if they are isomorphic. Two strings s and t are isomorphic if the characters in s can be replaced to get t. All occurrenc...
LeetCode 205. Isomorphic Strings 원문 Given two strings s and t, determine if they are isomorphic. Two strings s and t are isomorphic if the characters in s can be replaced to get t. All occurrenc...
LeetCode 242. Valid Anagram 원문 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...
LeetCode 383. Ransom Note 원문 Given two strings ransomNote and magazine, return true if ransomNotecan be constructed by using the letters from magazine and false otherwise. Each letter in magazine...
LeetCode 219. Contains Duplicate II 원문 Given an integer array nums and an integer k, return true if there are two distinct indices i and j in the array such that nums[i] == nums[j] and abs(i - j) ...
LeetCode 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 ...
LeetCode 150. Evaluate Reverse Polish Notation 원문 You are given an array of strings tokens that represents an arithmetic expression in a Reverse Polish Notation. Evaluate the expression. Return a...
LeetCode 155. Min Stack 원문 Design a stack that supports push, pop, top, and retrieving the minimum element in constant time. Implement the MinStack class: MinStack() initializes the stack obj...
LeetCode 21. Merge Two Sorted Lists 원문 You are given the heads of two sorted linked lists list1 and list2. Merge the two lists into one sorted list. The list should be made by splicing together t...
LeetCode 2. Add Two Numbers 원문 You are given two non-empty linked lists representing two non-negative integers. The digits are stored in reverse order, and each of their nodes contains a single di...
LeetCode 141. Linked List Cycle 원문 Given head, the head of a linked list, determine if the linked list has a cycle in it. There is a cycle in a linked list if there is some node in the list that ...