递归:
int Power(int n, int k){
if (n == 0)
return -1;
if (k == 0)
return 1;
return n*Power(n, k-1);
}
非递归:
int Power1(int n, int k){
int ret = 1;
if (n == 0)
return -1;
if (k == 0)
return 1;
for (int i = k; i > 0; i--){
ret *= n;
}
return ret;
}