03 2022 档案
摘要：#include<bits/stdc++.h> using namespace std; const int maxn=100000+10; const int INF=2*int(1e9)+10; #define LL long long int cmd(int a,int b){ return
阅读全文
摘要：https://registry.npmmirror.com/binary.html?path=node/
阅读全文
摘要：https://hub.docker.com/_/microsoft-dotnet?tab=description https://hub.docker.com/_/microsoft-dotnet-sdk/ https://hub.docker.com/_/microsoft-dotnet-asp
阅读全文
摘要：https://leetcode-cn.com/problems/interval-list-intersections/ class Solution { public: vector<vector<int>> intervalIntersection(vector<vector<int>>& f
阅读全文
摘要：docker run -itd --name node10 -v D:\GitHome\wxy\SocialClass\SocialClassWeb:/data node:10.0.0-alpine
阅读全文
摘要：https://leetcode-cn.com/problems/k-th-smallest-in-lexicographical-order/ #include<bits/stdc++.h> using namespace std; int getSteps(int curr, long n) {
阅读全文
摘要：#include<bits/stdc++.h> using namespace std; int main() { int x; x=8; cout<<bitset<sizeof(x)*8>(x)<<endl;//int占4字节，一个字节8位，最终输出的是32个0或1 cout<<bitset<si
阅读全文
摘要：https://iai.sh.cn/problem/608 #include<stdio.h> #include<iostream> #include<cmath> #include<vector> #include<map> #include<algorithm> using namespace
阅读全文
摘要：class Solution { public: vector<vector<int>> updateMatrix(vector<vector<int>>& mat) { int dx[4]={0,0,1,-1}; int dy[4]={1,-1,0,0}; int n=mat.size(); in
阅读全文