leetcode::longest_happy_string::Solution类 参考

#include <leetcode.h>

静态 Public 成员函数
static int *	get_p (char ch, int *a, int *b, int *c)
static string	longestDiverseString (int a, int b, int c)
static void	sort (char ch[3], int a, int b, int c)

详细描述

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

成员函数说明

get_p()

int * leetcode::longest_happy_string::Solution::get_p ( char ch, int * a, int * b, int * c )

static

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

                                                            {
            switch(ch) {
                case 'a': return a;
                case 'b': return b;
                case 'c': return c;
                default: return nullptr;
            }
        }

被这些函数引用 longestDiverseString().

longestDiverseString()

string leetcode::longest_happy_string::Solution::longestDiverseString ( int a, int b, int c )

static

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

                                                                 {
            auto oss   = ostringstream();
            int count  = 0;
            char prev  = '0';
            char ch[3] = {};
            sort(ch, a, b, c);
            while(a != 0 || b != 0 || c != 0) {
                if(!(count == 2 && prev == ch[2] && *get_p(ch[2], &a, &b, &c) > 0)) {
                    oss << ch[2];
                    (*get_p(ch[2], &a, &b, &c))--;
                    if(prev == ch[2]) {
                        count++;
                    } else {
                        prev  = ch[2];
                        count = 1;
                    }
                } else if(!(count == 2 && prev == ch[1]) && *get_p(ch[1], &a, &b, &c) > 0) {
                    oss << ch[1];
                    (*get_p(ch[1], &a, &b, &c))--;
                    if(prev == ch[1]) {
                        count++;
                    } else {
                        prev  = ch[1];
                        count = 1;
                    }
                } else if(!(count == 2 && prev == ch[0]) && *get_p(ch[0], &a, &b, &c) > 0) {
                    oss << ch[0];
                    (*get_p(ch[0], &a, &b, &c))--;
                    if(prev == ch[0]) {
                        count++;
                    } else {
                        prev  = ch[0];
                        count = 1;
                    }
                } else {
                    return oss.str();
                }
                sort(ch, a, b, c);
            }
            return oss.str();
        }

引用了 get_p() , 以及 sort().

被这些函数引用 leetcode::longest_happy_string::TEST() , 以及 leetcode::longest_happy_string::TEST().

sort()

void leetcode::longest_happy_string::Solution::sort ( char ch[3], int a, int b, int c )

static

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

                                                         {
            int minimum = a;
            ch[0]       = 'a';
            int maximum = b;
            ch[2]       = 'b';
            if(minimum > b) {
                minimum = b;
                ch[0]   = 'b';
            }
            if(minimum > c) {
                minimum = c;
                ch[0]   = 'c';
            }
            if(maximum < a) {
                maximum = a;
                ch[2]   = 'a';
            }
            if(maximum < c) {
                maximum = c;
                ch[2]   = 'c';
            }
            ch[1] = 'a' + 'b' + 'c' - ch[0] - ch[2];
        }

被这些函数引用 longestDiverseString().

---

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

• leetcode.h
• leetcode.cpp