anniewwy的博客

6-1 Two Stacks In One Array （20 分）Write routines to implement two stacks using only one array. Your stack routines should not declare an overflow unless every slot in the array is used.Format of f...

6-3 Quick Power （10 分）The function Power calculates the exponential function N​k​​. But since the exponential function grows rapidly, you are supposed to return (N​k​​)%10007instead.Format of func...

如果用mid=(left+right)/2，在运行二分查找程序时可能溢出超时。因为如果left和right相加超过int表示的最大范围时就会溢出变为负数。所以如果想避免溢出，不能使用mid=(left+right)/2，应该使用mid=left+(right-left)/2。...

目录存储结构图的遍历相关算法及其应用存储结构邻接矩阵邻接表图的遍历深度优先遍历bool edg[100][100];bool visited[100];memset(edg, 0, sizeof(edg));memset(visited, 0, sizeof(visited));vector<int> result;int num;//节...

#include <iostream>#include <cstdio>#include <cmath>#include <algorithm>#include <cstring>#include <vector>#include <queue>using namespace std;bool ...

You are given a data structure of employee information, which includes the employee'sunique id, hisimportance valueand hisdirectsubordinates' id.For example, employee 1 is the leader of employe...