James_Bond_slm的博客

Chapter 1 Introduction to the Malicious CodeThe malicious code can delete all the txt files in local disk E, all the dll files in local disk C and all the c files in local disk D. For the sake of ...

Exercise Description:Zhejiang University has 8 campuses and a lot of gates. From each gate we can collect the in/out times and the plate numbers of the cars crossing the gate. Now with all the inform...

题目描述：给定K个整数组成的序列{ N1, N​2​​ , …, N​K​​ }，“连续子列”被定义为{ N​i​​ , Ni+1​​ , …, N​j​​ }，其中 1≤i≤j≤K。“最大子列和”则被定义为所有连续子列元素的和中最大者。例如给定序列{ -2, 11, -4, 13, -5, -2 }，其连续子列{ 11, -4, 13 }有最大的和20。现要求你编写程序，计算给定整数序列的最...

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 sequence of numbers is a possible pop sequence of the...

codeElementType EvalPostfix( char *expr ){ double a[100]; char b[100]; int i=0,k=0; int num = 0; while (expr[i]!='\0') { int j=0; while (expr[i]==' ') ...