Dfine

分类

/ 注册

全部文章（共78篇）

题解 | 2的个数

class Count2 { public: int countNumberOf2s(int n) { // write code here int low = 0; int high = n / 10; int cur =...

2025-07-10

0 26

题解 | 整数对查找

#include <algorithm> #include <unordered_map> class FindPair { public: int countPairs(vector<int> A, int n, int sum) { ...

2025-07-10

0 25

题解 | 最小调整有序

#include <vector> class Rearrange { vector<int> findSegment_extra(const vector<int>&A){ if(A.size()<2) return {0,...

2025-07-10

0 24

题解 | 珠玑妙算

#include <set> #include <string> #include <unordered_map> class Result { public: vector<int> calcResult(string A, string...

2025-07-10

0 29

题解 | 变位词排序

#include <algorithm> #include <array> #include <set> #include <unordered_map> #include <vector> class SortString { pub...

2025-07-09

0 31

题解 | 走格子

#include <array> #include <queue> #include <vector> class Flood { public: int floodFill(vector<vector<int> > map, ...

2025-07-09

0 30

题解 | 字符串排列

#include <algorithm> #include <vector> class Permutation { void dfs(const string&A, string &cur, vector<bool> used, vect...

2025-07-09

0 37

题解 | 集合的子集

#include <algorithm> #include <vector> class Subset { void dfs(const vector<int> &A, int index, vector<int> &cur, ...

2025-07-09

0 32

题解 | 最大字母矩阵

class AlphaMatrix { public: int findAlphaMatrix(vector<string> dic, int n) { // write code here int maxArea = 0; ...

2025-07-09

0 29

题解 | 最大和子矩阵

#include <vector> class SubMatrix { public: int sumOfSubMatrix(vector<vector<int> > mat, int n) { // write code here ...

2025-07-09

0 28