RobustJay

分类

题解(8)

/ 注册

全部文章（共8篇）

题解 | #最接近的数#

class CloseNumber { public: vector<int> getCloseNumber(int x) { // write code here bitset<32> lower(x); bitset...

C++ 贪心双指针

2022-03-28

0 377

题解 | #跳跃游戏(二)#

#include <iostream> #include <vector> using namespace std; class solution { public: void getResult(vector<int> &nums) ...

C++ 动态规划贪心

2022-03-13

0 398

题解 | #正则表达式匹配#

动态规划 #include <iostream> #include <vector> #include <bitset> using namespace std; class solution { public: int getResult(const...

C++ 动态规划

2022-03-13

0 385

题解 | #最长上升子序列(一)#

常规动态规划 #include <iostream> #include <vector> using namespace std; class solution { public: int getResult(vector<int> &nums...

C++ 动态规划贪心二分查找树状数组

2022-03-09

1 477

题解 | #象棋路径#

#include <iostream> #include <vector> using namespace std; const int MOD = 1e9 + 7; const int pos[8][2] = {{-2, 1}, {-2, -1}, {2, 1}, {2...

C++ 动态规划

2022-03-09

0 349

题解 | #最大子矩阵#

#include <iostream> #include <vector> #include <climits> using namespace std; class solution { public: int getResult(vector<...

C++ 动态规划

2022-03-08

0 301

题解 | #乘积为正数的最长连续子数组#

#include <iostream> #include <vector> #include <climits> using namespace std; class solution { public: int getResult(vector<...

C++ 动态规划

2022-03-08

0 437

题解 | #连续子数组的最大乘积#

#include <iostream> #include <vector> #include <climits> using namespace std; class solution { public: int getResult(vector<...

C++ 动态规划

2022-03-08

0 470