Power by Repeated Multiplication

Problema

Compute base to the power exponent by multiplying base by itself exponent times in a loop. Any number to the power 0 is 1.

Implement power(base, exponent).

base: The base. exponent: The exponent (zero or positive).

Return base raised to exponent.

-10 ≤ base ≤ 10; 0 ≤ exponent ≤ 18

Ejemplo 1

Entrada:
base = 2
exponent = 10

Salida esperada:
expected = 1024

Entrada:
long long base = 2;
long long exponent = 10;

Salida esperada:
long long expected = 1024;

Entrada:
long base = 2;
long exponent = 10;

Salida esperada:
long expected = 1024;

2 multiplied by itself 10 times is 1024.

Ejemplo 2

Entrada:
base = 5
exponent = 0

Salida esperada:
expected = 1

Entrada:
long long base = 5;
long long exponent = 0;

Salida esperada:
long long expected = 1;

Entrada:
long base = 5;
long exponent = 0;

Salida esperada:
long expected = 1;

Anything to the power 0 is 1.

Inténtalo primero por tu cuenta y luego abre las pistas una a una.

Pista 1

The exponent tells you how many times to keep multiplying the base into an accumulating result.

Pista 2

Start from the neutral value for multiplication so the zero-exponent case works naturally.

Pista 3

Watch for the edge case where the exponent is zero, since no looping should still give a valid answer.

Complejidad esperada

O(exponent) time, O(1) extra space

Este reto está adaptado para CodeUtility. Sigue el enunciado y las restricciones indicadas arriba.