每天一道编程题题目描述样例python解法C语言解法题目描述Given an integer, write a function to determine if it is a power of three.题目大意给定一个整数判断这个整数是否是3的n次幂样例Example 1:Input: 27Output: trueExample 2:Input: 0Output: falseExample 3:Input: 9Output: trueExample 4:Input: 45Output: falsepython解法classSolution:defisPowerOfThree(self,n:int)-bool:returnn0and1162261467%n0Runtime: 96 msMemory Usage: 13.9 MB题后反思这应该是最简单的一种写法了但却不是最快的写法。1162261467是32位有符号整数里面可接受的3的次幂最大的整数。C语言解法boolisPowerOfThree(intn){returnn0?1162261467%n0:false;}Runtime: 12 ms, faster than 82.84% of C online submissions for Power of Three.Memory Usage: 7.5 MB, less than 50.00% of C online submissions for Power of Three.题后反思无boolisPowerOfThree(intn){while(n2){if(n%3)returnfalse;n/3;}returnn1;}Runtime: 24 msMemory Usage: 7.5 MB文中都是我个人的理解如有错误的地方欢迎下方评论告诉我我及时更正大家共同进步