使用迭代来计算出权力 [英] Using iteration to work out powers

问题描述

我基本上是在尝试重写math.pow，我有以下内容显然我没有得到返回值的概念。我究竟做错了什么？

I'm basically trying to rewrite math.pow, I have the following obviously I'm not getting the concept of returning values. What exactly am I doing wrong?

public static int power(int x, int n)
{
    if (n == 0) return 1;
    int i,total;
    for(i = 0; i < n-1 ;i++);
    {   
        total = (x * total);
    }
    return total;


}

推荐答案

你需要将总数初始化为1。

You need to initialize total to 1.

int total = 1;

您可以将所有内容重写为：

You can just rewrite everything to:

public static int power(int x, int n)
{
    int total = 1;
    for(int i = 0; i < n; i++) // i can be declared here directly
    {   
        total = (x * total);
    }
    return total; // total remains 1 if n = 0   
}

这篇关于使用迭代来计算出权力的文章就介绍到这了，希望我们推荐的答案对大家有所帮助，也希望大家多多支持IT屋！