LUO

贴个C++解法，状态选的是K和起点而非K和终点(结果相同)，用二维数组+pair类型直接构造有向加权图，常规DP ```C++ class Solution { vector memo; vector graph; public: void buildGraph(vector& flights, int n) { graph.assign(n, vector()); for (auto flight: flights) { int from = flight[0]; int to =...

让字符串成为回文串的最少插入次数，贴一个精简的从顶向下的C++。跟着东哥做了不少DP，感觉还是从顶向下带个备忘录更简单一点，有一些图的问题从base case出发自底向上更好 ```C++ class Solution { vector memo; public: // 返回s[i, j] 变成回文串的最少插入次数 int dp(string& s, int i, int j) { // base case if (i >= j) return 0;...

第一章早就刷完了怎么还没小旗子，原来更新了

根据东哥前一题的思路自己写了个方法, 对自己来说更容易想到。每个need对应两个右括号，每次出现右括号需要判断是否连续，若不连续则添加右括号; ```C++ class Solution { public: int minInsertions(string s) { int res = 0; int need = 0; // 需要右括号对的数量 for (int i = 0; i < s.length();) {...

跟着东哥刷完了，每道题都手敲了一遍，祝各位秋招好运

写了个C++版本的，力扣居然超时了，没搞懂为啥会超时 ```C++ class Solution { vector nums; public: Solution(vector& nums) { this->nums.assign(nums.begin(), nums.end()); } int pick(int target) { int counter = 0; int res = -1; for (int i =...

我尝试使用model.built = True使这个问题不再报错，但是接下来在训练的 model((batch_imgs, batch_metas, batch_bboxes, batch_labels), training=True)这行会报错， indices[192] = [192, -1] does not index into shape [256,81,4] [Op:TensorScatterUpdate] During handling of the above exception, another exception occurred: File "C:\Users\lhcez\Desktop\tf-eager-fasterrcnn-master\tf-eager-fasterrcnn-master\detection\core\bbox\bbox_target.py",...