leetcode::maximum_points_in_an_archery_competition::Solution类 参考

#include <leetcode.h>

静态 Public 成员函数
static vector< int >	maximumBobPoints (int numArrows, vector< int > &aliceArrows)

详细描述

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

成员函数说明

maximumBobPoints()

vector< int > leetcode::maximum_points_in_an_archery_competition::Solution::maximumBobPoints ( int  numArrows, vector< int > &  aliceArrows  )

static

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

                                                                                      {
            int maximum = 0;
            int max_n   = 0;
            for(unsigned int n = 1; n < 1 << 11; n++) {
                int rest  = numArrows;
                int score = 0;
                for(int i = 0; i <= 10; i++) {
                    if((n & 1 << i) != 0) {
                        score += 11 - i;
                        rest -= aliceArrows[11 - i] + 1;
                    }
                    if(rest < 0) {
                        goto NEXT_N;
                    }
                }
                if(maximum < score) {
                    maximum = score;
                    max_n   = n;
                }
            NEXT_N:;
            }
            vector ans(aliceArrows.size(), 0);
            for(int i = 0; i <= 10; i++) {
                if((max_n & 1 << i) != 0) {
                    numArrows -= aliceArrows[11 - i] + 1;
                    ans[11 - i] = aliceArrows[11 - i] + 1;
                }
            }
            ans[0] += numArrows;
            return ans;
        }

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

---

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

• leetcode.h
• leetcode.cpp