Winjourn的专栏

题目链接：http://www.patest.cn/contests/mooc-ds【打印沙漏】#include #include #include using namespace std;int num[1000];int main(){ num[1]=1; int sum=0; int tmp=1; for(int i=1;i<32;i++){ num[i+1]=

题目按照指数递减的顺序给出两个一元多项式，输出两个多项式的乘积，还有 和 ，按照指数递减的顺序。用链表实现一元多项式的乘法与加法运算。首先来看加法运算多项式 poly1   x^4 + 3x^3 + 6x多项式 poly2   6x^5 + 4x^4 + 6既然用到链表，自然少不了结构体struct node{ int coef; //系数 int expn; //

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 sequenc