leetcode::plates_between_candles::Solution类 参考

#include <leetcode.h>

静态 Public 成员函数
static vector< int >	platesBetweenCandles (string s, vector< vector< int > > &queries)

详细描述

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

成员函数说明

platesBetweenCandles()

vector< int > leetcode::plates_between_candles::Solution::platesBetweenCandles ( string  s, vector< vector< int > > &  queries  )

static

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

                                                                                         {
            vector<int> ans;
            vector<int> plate_count(s.length());
            vector<int> candle_pos;
            if(s[0] == '*') {
                plate_count[0] = 1;
            } else {
                plate_count[0] = 0;
                candle_pos.push_back(0);
            }
            for(int i = 1; i < s.length(); i++) {
                plate_count[i] = plate_count[i - 1];
                if(s[i] == '*') {
                    plate_count[i]++;
                } else {
                    candle_pos.push_back(i);
                }
            }
            for(auto query: queries) {
                int left  = query[0];
                int right = query[1];
                auto li   = lower_bound(candle_pos.begin(), candle_pos.end(), left);
                if(li == candle_pos.end() || *li > right) {
                    ans.push_back(0);
                    continue;
                }
                auto ri = lower_bound(candle_pos.rbegin(), candle_pos.rend(), right, greater<int>());
                if(ri == candle_pos.rend() || *ri < left) {
                    ans.push_back(0);
                    continue;
                }
                ans.push_back(plate_count[*ri] - plate_count[*li]);
            }
            return ans;
        }

引用了 acwing::acwing1929::left , 以及 acwing::acwing1929::right.

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

---

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

• leetcode.h
• leetcode.cpp