摘要：link class Solution { public: vector<string> maxNumOfSubstrings(string s) { int n=s.size(); vector<int> left(26,n); vector<int> right(26,-1); for(int 阅读全文

摘要：link class Solution { public: int n; double eps=1E-6; const int dx[4]={-1,0,1,0}; const int dy[4]={0,1,0,-1}; double getMinDistSum(vector<vector<int>> 阅读全文

摘要：git官网下载： https://www.git-scm.com/download/win ssh 连接 生成密匙： ssh-keygen -t rsa -C "email" 在~/.ssh中生成了key，把.pub复制到github的setting中 测试： ssh -T git@github.c 阅读全文

摘要：link Solution1: class Solution { public: int m; int n; int numSubmat(vector<vector<int>>& mat) { m=mat.size(); n=mat[0].size(); int res=0; for(int up= 阅读全文

摘要：link Given a string num representing the digits of a very large integer and an integer k. You are allowed to swap any two adjacent digits of the integ 阅读全文