Leetcode 50. Pow(x, n)

Sdílet
Vložit
  • čas přidán 7. 09. 2024
  • Telegram Link:
    t.me/+FieKB7Ds...
    t.me/+JU-ZF-oD...
    Problem Link: leetcode.com/p...
    Solution Link: leetcode.com/p...

Komentáře • 3

  • @ALSANIVADABABURAO
    @ALSANIVADABABURAO Před rokem +2

    UnderStood
    Nice Explanation

  • @ALSANIVADABABURAO
    @ALSANIVADABABURAO Před rokem +1

    Can I know why we take the value of n as long
    In the Below function every time we reduce the value of n by 2 there wont be any overflow because the value is reducing