파비의 매일매일 공부기록

2023.07.24 Today's Challenge 본문

Problem Solving/LeetCode

2023.07.24 Today's Challenge

fabichoi 2023. 7. 24. 23:45

https://leetcode.com/problems/powx-n/

 

Pow(x, n) - LeetCode

Can you solve this real interview question? Pow(x, n) - Implement pow(x, n) [http://www.cplusplus.com/reference/valarray/pow/], which calculates x raised to the power n (i.e., xn).   Example 1: Input: x = 2.00000, n = 10 Output: 1024.00000 Example 2: Inpu

leetcode.com

의도했던 바는 아닌거 같은데 여튼 풀어나가긴 함.

class Solution:
    def myPow(self, x: float, n: int) -> float:
        return pow(x, n)
반응형

'Problem Solving > LeetCode' 카테고리의 다른 글

2023.07.26 Today's Challenge  (0) 2023.07.26
2023.07.25 Today's Challenge  (0) 2023.07.25
2023.07.23 Today's Challenge  (0) 2023.07.23
2023.07.22 Today's Challenge  (0) 2023.07.22
2023.07.21 Today's Challenge  (0) 2023.07.21
'Problem Solving/LeetCode' Related Articles more
Comments