leetcode::jump_game_iv::Solution类 参考

#include <leetcode.h>

静态 Public 成员函数
static int	minJumps (vector< int > &arr)

详细描述

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

成员函数说明

minJumps()

int leetcode::jump_game_iv::Solution::minJumps ( vector< int > &  arr )

static

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

                                               {
            if(arr.size() == 1) {
                return 0;
            }
            auto pq    = queue<pair<int, int>>();//<下标,step>
            auto *flag = new bool[arr.size()];
            memset(flag, 0, arr.size() * sizeof(bool));
            auto um = unordered_map<int, vector<int>>();//<值,下标>
            for(int i = 0; i < arr.size(); i++) {
                if(!um.contains(arr[i])) {
                    auto vec = vector<int>();
                    vec.push_back(i);
                    um.insert(pair(arr[i], vec));
                } else {
                    um[arr[i]].push_back(i);
                }
            }
            pq.push(pair(0, 0));
            flag[0] = true;
            while(!pq.empty()) {
                auto [current_i, current_count] = pq.front();
                pq.pop();
                if(current_i == arr.size() - 1) {
                    return current_count;
                }
                if(um.contains(arr[current_i])) {
                    for(auto i: um[arr[current_i]]) {
                        if(i != current_i && !flag[i]) {
                            pq.push(pair(i, current_count + 1));
                            flag[i] = true;
                        }
                    }
                }
                um.erase(arr[current_i]);
                if(current_i - 1 >= 0 && !flag[current_i - 1]) {
                    pq.push(pair(current_i - 1, current_count + 1));
                    flag[current_i - 1] = true;
                }
                if(current_i + 1 < arr.size() && !flag[current_i + 1]) {
                    pq.push(pair(current_i + 1, current_count + 1));
                    flag[current_i + 1] = true;
                }
            }
            delete[] flag;
            return 0;
        }

引用了 pat::a::a7_2::vec.

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

---

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

• leetcode.h
• leetcode.cpp