sinat_34080511的博客

auto start = std::chrono::high_resolution_clock::now(); for (auto test_num = 0; test_num < num_tests; ++test_num) { if (test_num % ten_percent == 0) { std::cout << "." << std::flush; } } auto end...

mkdir src/golang.org/x/cd src/golang.org/x/git clone https://github.com/golang/crypto.gitgit clone https://github.com/golang/net.gitgit clone https://github.com/golang/sys.gitgit clone https...

InputStream path = this.getClass().getResourceAsStream("/data.txt");BufferedReader reader = new BufferedReader(new InputStreamReader(path));   

class Kmeans(): def __init__(): self.k_dict_last = defaultdict(list) self.k_dict = defaultdict(list) self.k_node = [] def eclidDist(vec1, vec2): sum = 0 ...

二叉树节点路径求和参考 https://www.nowcoder.com/questionTerminal/840dd2dc4fbd4b2199cd48f2dadf930a另一种解法：整体思路就是递归的去检索，每当经过一个节点的时候，就把节点值放入vector中，当到达叶子节点时，判断此时vector中的和是否等于给定sum，等于的话表示这是一条符合条件的路径，打印该路径。否则清空ve...

１．LIS状态设计：F[i]代表以A[i]结尾的LIS的长度状态转移：F[i]=max{F[j]+1}(1&lt;=j&lt; i,A[j]&lt; A[i])边界处理：F[i]=1(1&lt;=i&lt;=n)时间复杂度：O(n^2)int main(){ scanf("%d",&amp;n); for(int i=1;i&lt;=n;i++) { ...

快速排序void QuickSort(int r[], int low, int high){ int pos; if(low &lt; high){ pos = partition(r, low, high); QuickSort(r, low, pos-1); QuickSort(r, pos+1, high); } }int partition...

１．滑雪//https://blog.youkuaiyun.com/qq_25202231/article/details/72925477// dp( i,j ) = Max( dp( i-1, j ), dp( i, j+1 ),dp( i+1, j ), dp( i, j-1 ) ) + 1;#include &lt;iostream&gt; #include &lt;fstream&...

参考：https://www.nowcoder.com/questionTerminal/5947ddcc17cb4f09909efa7342780048链接：https://www.nowcoder.com/questionTerminal/5947ddcc17cb4f09909efa7342780048来源：牛客网/* "滑动窗口" 比方说 abcabccc 当你...

二分查找、牛顿法求开根号#include&lt;stdio.h&gt;float sqr(float n, float r){ float mid = n / 2; float min, max; min = 0; max = n; while ((mid*mid - n &gt; r) ||(mid*mid - n &lt; -r)) { if (mid...

可以被next()函数调用并不断返回下一个值的对象称为迭代器(Iterator)。使用yield的函数被称为generator，generator就是一个Iterator。generator调用next，遇到yield语句返回。再次执行时从上次的yield语句处继续执行。创建generator的方法：1. 把列表表达式的[]改为(); 2.把函数中的print改为yield# -*- codi