09 2023 档案
摘要：The difference between undergraudate and postgraduate? The undergraduate education provides foundational knowledge and skills in a broad discipline. T
阅读全文
摘要：c++中如何判断一个浮点数是否为0？ 判断是否在一个误差范围内: cpp const float eps = 1e-6; if(abs(x) < eps) { // x is nearly zero } 舍入到整数再判断: cpp float x = 0.00001; if(round(x) ==
阅读全文
摘要：题目： In the big cities, the subway systems always look so complex to the visitors. To give you some sense, the following figure shows the map of Beijin
阅读全文
摘要：题目： Cutting an integer means to cut a K digits lone integer Z into two integers of (K/2) digits long integers A and B. For example, after cutting Z =
阅读全文
摘要：题目： There is a kind of balanced binary search tree named red-black tree in the data structure. It has the following 5 properties: (1) Every node is ei
阅读全文
摘要：题目： Consider a positive integer N written in standard notation with k+1 digits ai as ak⋯a1a0 with 0≤ai<10 for all i and ak>0. Then N is palindro
阅读全文
摘要：题目： For a student taking the online course "Data Structures" on China University MOOC (http://www.icourse163.org/), to be qualified for a certificate,
阅读全文
摘要：题目： Suppose that all the keys in a binary tree are distinct positive integers. Given the preorder and inorder traversal sequences, you are supposed to
阅读全文
摘要：题目： After each PAT, the PAT Center will announce the ranking of institutions based on their students' performances. Now you are asked to generate the
阅读全文
摘要：题目： A clique is a subset of vertices of an undirected graph such that every two distinct vertices in the clique are adjacent. A maximal clique is a cl
阅读全文
摘要：题目： The lowest common ancestor (LCA) of two nodes U and V in a tree is the deepest node that has both U and V as descendants. A binary search tree (BS
阅读全文
摘要：硬链接就是在目录下创建一个条目，记录着文件名与 inode 编号，这个 inode 就是源文件的 inode。删除任意一个条目，文件还是存在，只要引用数量不为 0。但是硬链接有限制，它不能跨越文件系统，也不能对目录进行链接。 软链接相当于重新创建⼀个⽂件，这个⽂件有独⽴的 inode，但是这个⽂件的
阅读全文
