본문 바로가기

LeetCode/Array & Hashing42

[LeetCode][Kotlin] 349. Intersection of Two Arrays 349. Intersection of Two ArraysGiven two integer arrays nums1 and nums2, return an array of their intersection. Each element in the result must be unique and you may return the result in any order.두 개의 정수 배열 nums1과 nums2가 주어지면, 교집합 의 배열을 반환합니다. 결과의 각 요소는 고유해야 하며, 어떤 순서로든 결과를 반환할 수 있습니다. Example 1:Input: nums1 = [1,2,2,1], nums2 = [2,2]Output: [2] Example 2:Input: nums1 = [4,9,5], nums2 = [9,4,9,.. 2024. 10. 18.
[LeetCode][Kotlin] 1624. Largest Substring Between Two Equal Characters 1624. Largest Substring Between Two Equal CharactersGiven a string s, return the length of the longest substring between two equal characters, excluding the two characters. If there is no such substring return -1. A substring is a contiguous sequence of characters within a string.문자열 s가 주어지면 두 문자를 제외하고 두 개의 동일한 문자 사이에서 가장 긴 부분 문자열의 길이를 반환합니다. 해당 하위 문자열이 없으면 -1을 반환합니다. 하위 문자열은 문자열 내의 연속적인 문자 시퀀스입.. 2024. 10. 18.
[LeetCode][Kotlin] 205. Isomorphic Strings 205. Isomorphic StringsGiven 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 occurrences of a character must be replaced with another character while preserving the order of characters. No two characters may map to the same character, but a character may map to itself.두 개의 문자열 s와 t가 주어지면 두 문자열이 동형인지 확인.. 2024. 10. 18.
[LeetCode][Kotlin] 929. Unique Email Addresses 929. Unique Email AddressesEvery valid email consists of a local name and a domain name, separated by the '@' sign. Besides lowercase letters, the email may contain one or more '.' or '+'.For example, in "alice@leetcode.com", "alice" is the local name, and "leetcode.com" is the domain name.If you add periods '.' between some characters in the local name part of an email address, mail sent there .. 2024. 10. 18.
[LeetCode][Kotlin] 14. Longest Common Prefix 14. Longest Common PrefixWrite a function to find the longest common prefix string amongst an array of strings. If there is no common prefix, return an empty string "".문자열 배열 중에서 가장 긴 공통 접두사 문자열을 찾는 함수를 작성하세요. 공통 접두사가 없으면 빈 문자열 ""을 반환합니다. Example 1:Input: strs = ["flower","flow","flight"]Output: "fl"Example 2:Input: strs = ["dog","racecar","car"]Output: ""Explanation: There is no common prefix a.. 2024. 10. 18.
[LeetCode][Kotlin] 799. Champagne Tower 799. Champagne TowerWe stack glasses in a pyramid, where the first row has 1 glass, the second row has 2 glasses, and so on until the 100th row.  Each glass holds one cup of champagne. Then, some champagne is poured into the first glass at the top.  When the topmost glass is full, any excess liquid poured will fall equally to the glass immediately to the left and right of it.  When those glasses.. 2024. 9. 25.
[LeetCode][Kotlin] 2610. Convert an Array Into a 2D Array With Conditions 2610. Convert an Array Into a 2D Array With ConditionsYou are given an integer array nums. You need to create a 2D array from nums satisfying the following conditions:The 2D array should contain only the elements of the array nums.Each row in the 2D array contains distinct integers.The number of rows in the 2D array should be minimal.Return the resulting array. If there are multiple answers, ret.. 2024. 9. 25.

티스토리툴바