맵3 [LeetCode] 516. Longest Palindromic Subsequence (golang) 문제Longest Palindromic Subsequence - LeetCodeGiven a string s, find the longest palindromic subsequence's length in s. A subsequence is a sequence that can be derived from another sequence by deleting some or no elements without changing the order of the remaining elements. Example 1: Input: s = "bbbab"Output: 4Explanation: One possible longest palindromic subsequence is "bbbb".https://leetco.. 2021. 6. 14. [LeetCode] 409. Longest Palindrome (golang) 문제Longest Palindrome - LeetCodeGiven a string s which consists of lowercase or uppercase letters, return the length of the longest palindrome that can be built with those letters. Letters are case sensitive, for example, "Aa" is not considered a palindrome here. Example 1: Input: s = "abccccdd"Output: 7Explanation: One longest palindrome that can be built is "dccaccd", whose length is 7.https://.. 2021. 6. 12. [LeetCode] 205. Isomorphic Strings (golang) 문제Isomorphic Strings - LeetCodeGiven 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.https://leetcode.com/problems/isomorphic-strings/구조가 같은 문자열 구분 구현각 문자열의 문자를 키로 받는 맵을 두 문자열 각각 생성문자열을 탐색하며 각 맵에.. 2021. 6. 2. 이전 1 다음
