05 2018 档案

[LeetCode] 342. Power of Four 4的次方数
摘要：Given an integer (signed 32 bits), write a function to check whether it is a power of 4. Example:Given num = 16, return true. Given num = 5, return fa 阅读全文
posted @ 2018-05-17 05:43 轻风舞动 阅读(530) 评论(0) 推荐(0) 编辑
[LeetCode] 326. Power of Three 3的次方数
摘要：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:Speci 阅读全文
posted @ 2018-05-17 05:22 轻风舞动 阅读(439) 评论(0) 推荐(0) 编辑
[LeetCode] 231. Power of Two 2的次方数
摘要：Given an integer, write a function to determine if it is a power of two. Example 1: Example 2: Example 3: 给一个整数，写一个函数来判断它是否为2的次方数。 利用计算机用的是二进制的特点，用位操作 阅读全文
posted @ 2018-05-17 04:57 轻风舞动 阅读(656) 评论(0) 推荐(0) 编辑
[LeetCode] 409. Longest Palindrome 最长回文
摘要：Given a string which consists of lowercase or uppercase letters, find the length of the longest palindromes that can be built with those letters. This 阅读全文
posted @ 2018-05-09 06:55 轻风舞动 阅读(417) 评论(0) 推荐(0) 编辑
[LeetCode] 214. Shortest Palindrome 最短回文串
摘要：Given a string s, you are allowed to convert it to a palindrome by adding characters in front of it. Find and return the shortest palindrome you can f 阅读全文
posted @ 2018-05-09 04:56 轻风舞动 阅读(609) 评论(0) 推荐(0) 编辑

点击右上角即可分享
微信分享提示