Leet Code OJ 326. Power of Three [Difficulty: Easy]

题目：
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?

翻译：
给定一个整数，写一个函数去判断它是否是3的幂。
更进一步：你能不使用循环或者递归来完成吗？

代码:

public class Solution {public boolean isPowerOfThree(int n) {if(n<=0){return false;}while(n!=1){if(n%3!=0){return false;}else{n/=3;}}return true;}
}

Leet Code OJ 326. Power of Three [Difficulty: Easy]相关推荐

Leet Code OJ 231. Power of Two [Difficulty: Easy]
题目: Given an integer, write a function to determine if it is a power of two. 分析: 题意是给定一个整数,判断它是不是2的幂 ...
Leet Code OJ 14. Longest Common Prefix [Difficulty: Easy]
题目: Write a function to find the longest common prefix string amongst an array of strings. 翻译: 写一个函数 ...
Leet Code OJ 118. Pascal's Triangle [Difficulty: Easy]
题目: Given numRows, generate the first numRows of Pascal's triangle. For example, given numRows = 5, ...
Leet Code OJ 88. Merge Sorted Array [Difficulty: Easy]
题目: Given two sorted integer arrays nums1 and nums2, merge nums2 into nums1 as one sorted array. Not ...
Leet Code OJ 110. Balanced Binary Tree [Difficulty: Easy]
题目: Given a binary tree, determine if it is height-balanced. For this problem, a height-balanced bin ...
Leet Code OJ 219. Contains Duplicate II [Difficulty: Easy]
题目: Given an array of integers and an integer k, find out whether there are two distinct indices i a ...
Leet Code OJ 172. Factorial Trailing Zeroes [Difficulty: Easy]
题目: Given an integer n, return the number of trailing zeroes in n!. Note: Your solution should be in ...
Leet Code OJ 206. Reverse Linked List [Difficulty: Easy]
题目: Reverse a singly linked list. Hint: A linked list can be reversed either iteratively or recursiv ...
Leet Code OJ 38. Count and Say [Difficulty: Easy]
题目: The count-and-say sequence is the sequence of integers beginning as follows: 1, 11, 21, 1211, 11 ...

Leet Code OJ 326. Power of Three [Difficulty: Easy]

Leet Code OJ 326. Power of Three [Difficulty: Easy]相关推荐

最新文章

热门文章