leetcode::maximize_number_of_subsequences_in_a_string::Solution类 参考

#include <leetcode.h>

静态 Public 成员函数
static long long	maximumSubsequenceCount (string text, string pattern)

详细描述

在文件 leetcode.h 第 1809 行定义.

成员函数说明

maximumSubsequenceCount()

long long leetcode::maximize_number_of_subsequences_in_a_string::Solution::maximumSubsequenceCount ( string  text, string  pattern  )

static

在文件 leetcode.cpp 第 4701 行定义.

                                                                               {
            long long ans   = 0;
            long long count = 0;
            vector<long long> p1count(text.length());
            long long p0count          = 0;
            long long p1c              = 0;
            p1count[text.length() - 1] = 0;
            for(int i = text.length() - 1; i >= 0; i--) {
                if(text[i] == pattern[1]) {
                    count++;
                } else if(text[i] == pattern[0]) {
                    p0count++;
                }
                if(i - 1 >= 0) {
                    p1count[i - 1] = count;
                }
            }
            for(int i = 0; i < text.length(); i++) {
                if(text[i] == pattern[0]) {
                    ans += p1count[i];
                }
            }
            ans += max(p0count, count);
            return ans;
        }

被这些函数引用 leetcode::maximize_number_of_subsequences_in_a_string::TEST().

---

该类的文档由以下文件生成:

• leetcode.h
• leetcode.cpp