x的m次方，比o(logn)略大的实现

public static int aa(int m,int x) {
int n = 1;
int mcopy = m;
int returnInt = 1;

while (true) {
if (x==1) {
break;
}
if (n*2<= x) {
returnInt*=m;
m*=m;
x -=n;
n*=2;
}else {
n=1;
m = mcopy;
}
}
returnInt *= mcopy;
return returnInt;
}