标签：string int alphabet ideal machine state length order

2370. 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 letters in t is less than or equal to k.

Return the length of the longest ideal string.

A subsequence is a string that can be derived from another string by deleting some or no characters without changing the order of the remaining characters.

Note that the alphabet order is not cyclic. For example, the absolute difference in the alphabet order of 'a' and 'z' is 25, not 1.

 Example 1:

Input: s = "acfgbd", k = 2
Output: 4
Explanation: The longest ideal string is "acbd". The length of this string is 4, so 4 is returned.
Note that "acfgbd" is not ideal because 'c' and 'f' have a difference of 3 in alphabet order.

Example 2:

Input: s = "abcd", k = 3
Output: 4
Explanation: The longest ideal string is "abcd". The length of this string is 4, so 4 is returned.

 Constraints:

• 1 <= s.length <= 105
• 0 <= k <= 25
• s consists of lowercase English letters.

class Solution {
    int result = 1;
    public int longestIdealString(String s, int k) {
        //标示26个字母在前面出现的最后一个位置
        int[] memo = new int[s.length()];
        int[] pos = new int[26];
        int result = 0;
        //开始初始化为-1，因为所有字母都没出现过
        Arrays.fill(pos, -1);
        for(int i=0;i<s.length();i++){
            char c = s.charAt(i);
            //从  c-k ~ c+k ,逐个进行判定，看这些字母那个的最后一个位置最长
            for(int j = Math.max(0, c-'a'-k);j <= Math.min(25, c-'a'+k); j++){
                if(pos[j] != -1){
                    //在k范围内的最长字母长度基础上+1
                    memo[i] = Math.max(memo[i], memo[pos[j]]+1);
                }
                if(memo[i] == 0) memo[i] = 1;
            }
            result = Math.max(result, memo[i]);
            pos[c-'a'] = i;
        }
        return result;
    }
}

 

标签：string,int,alphabet,ideal,machine,state,length,order
来源： https://www.cnblogs.com/cynrjy/p/16634609.html

本站声明： 1. iCode9 技术分享网（下文简称本站）提供的所有内容，仅供技术学习、探讨和分享；
2. 关于本站的所有留言、评论、转载及引用，纯属内容发起人的个人观点，与本站观点和立场无关；
3. 关于本站的所有言论和文字，纯属内容发起人的个人观点，与本站观点和立场无关；
4. 本站文章均是网友提供，不完全保证技术分享内容的完整性、准确性、时效性、风险性和版权归属；如您发现该文章侵犯了您的权益，可联系我们第一时间进行删除；
5. 本站为非盈利性的个人网站，所有内容不会用来进行牟利，也不会利用任何形式的广告来间接获益，纯粹是为了广大技术爱好者提供技术内容和技术思想的分享性交流网站。