#include <leetcode.h>
◆ countCollisions()
int leetcode::count_collisions_on_a_road::Solution::countCollisions |
( |
const string & |
directions | ) |
|
|
static |
在文件 leetcode.cpp 第 4783 行定义.
4785 vector<char> status;
4788 for(
char ch: directions) {
4789 if(status.empty()) {
4790 status.push_back(ch);
4793 if(status.back() == ch) {
4796 status.push_back(ch);
4797 count.push_back(current);
4802 count.push_back(current);
4803 for(
int i = 0; i + 1 < status.size(); i++) {
4804 if(status[i] ==
'R' && status[i + 1] ==
'L') {
4805 ans += count[i] + count[i + 1];
4806 }
else if(status[i] ==
'R' && status[i + 1] ==
'S') {
4808 }
else if(status[i] ==
'S' && status[i + 1] ==
'L') {
4809 ans += count[i + 1];
被这些函数引用 leetcode::count_collisions_on_a_road::TEST().
该类的文档由以下文件生成: