程序師世界是廣大編程愛好者互助、分享、學習的平台,程序師世界有你更精彩!
首頁
編程語言
C語言|JAVA編程
Python編程
網頁編程
ASP編程|PHP編程
JSP編程
數據庫知識
MYSQL數據庫|SqlServer數據庫
Oracle數據庫|DB2數據庫
 程式師世界 >> 編程語言 >> C語言 >> C++ >> C++入門知識 >> Leetcode 326:Power of Three

Leetcode 326:Power of Three

編輯:C++入門知識

Leetcode 326:Power of Three


Given an integer, write a function to determine if it is a power of three.

Follow up:
Could you do it without using any loop / recursion?

Credits:
Special thanks to@dietpepsifor adding this problem and creating all test cases.

 

Subscribeto see which companies asked this question

 

//給定一個整數,編寫函數判斷它是否為3的冪
class Solution {
public:
    bool isPowerOfThree(int n) {
        if(n>1)
        {
            while(n%3==0) 
               n=n/3;
        }
        return n==1;
    }
};

\

  1. 上一頁:
  2. 下一頁:
Copyright © 程式師世界 All Rights Reserved