leetcode::push_dominoes::Solution类 参考

#include <leetcode.h>

静态 Public 成员函数
static string	pushDominoes (string dominoes)

详细描述

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

成员函数说明

pushDominoes()

string leetcode::push_dominoes::Solution::pushDominoes ( string  dominoes )

static

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

                                                     {
            const int n      = dominoes.length();
            auto *left_to_r  = new int[n];
            auto *right_to_l = new int[n];
            auto *left_is    = new char[n];
            auto *right_is   = new char[n];
            int l2r          = 0;
            int r2l          = 0;
            char ch          = '.';
            for(int i = 0; i < n; i++) {
                if(dominoes[i] != '.') {
                    ch = dominoes[i];
                }
                left_is[i] = ch;
            }
            ch = '.';
            for(int i = n - 1; i >= 0; i--) {
                if(dominoes[i] != '.') {
                    ch = dominoes[i];
                }
                right_is[i] = ch;
            }
            for(int i = 0; i < n; i++) {
                if(dominoes[i] == 'R') {
                    l2r = 0;
                } else {
                    l2r++;
                }
                left_to_r[i] = l2r;
            }
            for(int i = n - 1; i >= 0; i--) {
                if(dominoes[i] == 'L') {
                    r2l = 0;
                } else {
                    r2l++;
                }
                right_to_l[i] = r2l;
            }
            for(int i = 0; i < n; i++) {
                if(dominoes[i] == '.') {
                    if(left_is[i] == 'R' && right_is[i] == 'L') {
                        if(right_to_l[i] > left_to_r[i]) {
                            dominoes[i] = 'R';
                        } else if(left_to_r[i] > right_to_l[i]) {
                            dominoes[i] = 'L';
                        }
                    } else if(right_is[i] == 'L') {
                        dominoes[i] = 'L';
                    } else if(left_is[i] == 'R') {
                        dominoes[i] = 'R';
                    }
                }
            }
            delete[] left_to_r;
            delete[] right_to_l;
            delete[] left_is;
            delete[] right_is;
            return dominoes;
        }

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

---

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

• leetcode.h
• leetcode.cpp