摘要：
In computer science, a heap is a specialized tree-based data structure that satisfies the heap property: if P is a parent node of C, then the key (the 阅读全文
摘要：
dijkstra版 for(int v = 0; v < n; v++) { if(visit[v] == false && e[u][v] != inf) { if(dis[u] + e[u][v] < dis[v]) { dis[v] = dis[u] + e[u][v]; w[v] = w[u 阅读全文
摘要：
整型转字符串： int c=100; string s=to_string(c); cout<<s<<endl; 字符串转整型： string s="10000"; int c=atoi(s.c_str()); cout<<c<<endl; 阅读全文
摘要：
本文从浙大群搬运而来，一年来一直保存在手机里，每次看完都很激动，受益匪浅。 要变强就三点——获得黑色生命力，抵抗时间扭曲，和创造。 而许多人连第一个坎都是捱不过去的。 1 先来说说何谓黑色生命力。 它是指，不断的被痛苦压住，又不断的翻身把痛苦给予痛击，并在这个互相搏击的过程中，获得一种更加旺盛的生命 阅读全文
摘要：
python安装第三方库超时问题： raise ReadTimeoutError(self._pool, None, "Read timed out.") pip._vendor.urll 原因：有些比较大的库，对网速要求较高，可以使用豆瓣源，提高下载速度 使用：pip install -i htt 阅读全文
摘要：
7-2 Lab Access Scheduling (25 分) Nowadays, we have to keep a safe social distance to stop the spread of virus due to the COVID-19 outbreak. Consequent 阅读全文
摘要：
Mice and Rice is the name of a programming contest in which each programmer must write a piece of code to control the movements of a mouse in a given 阅读全文
摘要：
Given a stack which can keep M numbers at most. Push N numbers in the order of 1, 2, 3, ..., N and pop randomly. You are supposed to tell if a given s 阅读全文
摘要：
Given a constant K and a singly linked list L, you are supposed to reverse the links of every K elements on L. For example, given L being 1→2→3→4→5→6, 阅读全文
摘要：
A linked list consists of a series of structures, which are not necessarily adjacent in memory. We assume that each structure contains an integer key 阅读全文