by Using BFS or Dijkstra algorithm

Blabla before diving into the question

Word Search II

Naive backtracking

typedef pair<int, int> PII;
const vector<PII> dirs = {{0, 1},{0, -1},{1, 0},{-1, 0}};
int seen[10][10];
class Solution {
string word;
vector<vector<char>> board;
int n, m;
bool backtrack(vector<PII>& candidates, int…


882. Reachable Nodes In Subdivided Graph

Rotate a Box Under Gravity


vector<vector<string>> rotate(vector<vector<string>>& matrix){
const int n = matrix.size(), m = matrix[0].size()…


计算机模型BERT 怎么看

Jimmy Shen

Data Scientist/MLE/SWE @takemobi

Get the Medium app

A button that says 'Download on the App Store', and if clicked it will lead you to the iOS App store
A button that says 'Get it on, Google Play', and if clicked it will lead you to the Google Play store