摘要： 1. 数组a[i], 求数组output，其中output[i]=product(a[j] | j!=i)void f(int *a, int *output, int n){ for(int i=0;i s; node *current = root; while(!s.empty()||current) { if(current) { s.push(current); current = current->left; } else { cur... 阅读全文