IncredibleThings

摘要： 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 false. Follow up: Could you solve it without loo... 阅读全文

摘要： 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? public class Solution { private static final double ep... 阅读全文

摘要： Given a list of non negative integers, arrange them such that they form the largest number. For example, given [3, 30, 34, 5, 9], the largest formed number is 9534330. Note: The result may be very ... 阅读全文

摘要： 题目说给我们一堆石子，每次可以拿一个两个或三个，两个人轮流拿，拿到最后一个石子的人获胜，现在给我们一堆石子的个数，问我们能不能赢。那么我们就从最开始分析，由于是我们先拿，那么3个以内(包括3个)的石子，我们直接赢，如果共4个，那么我们一定输，因为不管我们取几个，下一个人一次都能取完。如果共5个，我们 阅读全文

摘要： Given a pattern and a string str, find if str follows the same pattern. Here follow means a full match, such that there is a bijection between a letter in pattern and a non-empty word in str. Examp... 阅读全文

摘要： 题目可以在O(n)时间复杂度内求解 算法步骤： 使用两个"指针"x和y，初始令y = 0 利用x遍历数组nums： 若nums[x]非0，则交换nums[x]与nums[y]，并令y+1 阅读全文

摘要： Write a program to check whether a given number is an ugly number. Ugly numbers are positive numbers whose prime factors only include 2, 3, 5. For example, 6, 8 are ugly while 14 is not ugly since i... 阅读全文

摘要： You are a product manager and currently leading a team to develop a new product. Unfortunately, the latest version of your product fails the quality check. Since each version is developed based on th... 阅读全文

摘要： Given a non-negative integer num, repeatedly add all its digits until the result has only one digit. For example: Given num = 38, the process is like: 3 + 8 = 11, 1 + 1 = 2. Since 2 has only one di... 阅读全文

摘要： 二刷： 阅读全文