Sgappti的博客

【力扣-LeetCode】1139. 最大的以 1 为边界的正方形 C++题解

【力扣-LeetCode】LCP 07. 传递信息 C++题解

#include <iostream>#include <stack>#include <map>#include <string.h>#include <queue>using namespace std;#define MaxSize 255#define InTree -1typedef int ElemType;typedef struct BiTNode{ ElemType data; struct.

11-散列4Hashing - Hard Version(30分)Given a hash table of sizeN, we can define a hash functionH(x)=x%N. Suppose that the linear probing is used to solve collisions, we can easily obtain the status ...