목록2024/04/25 (1)

넘치게 채우기

[LeetCode] 2370. Longest Ideal Subsequence

https://leetcode.com/problems/longest-ideal-subsequence/description/Leetcode - Longest Ideal Subsequence문제 유형 : 다이나믹 프로그래밍, 문자열처리문제 난이도 : Medium 문제You are given a string s consisting of lowercase letters and an integer k. We call a string t ideal if the following conditions are satisfied:t is a subsequence of the string s.The absolute difference in the alphabet order of every two adjacent letter..
PS/LeetCode 2024. 4. 25. 16:29
이전 Prev 1 Next 다음