math
文章平均质量分 52
路漫远吾求索
电子,无线局域网
展开
-
Leetcode——258. Add Digits
题目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 digit,原创 2017-01-18 00:00:22 · 242 阅读 · 0 评论 -
Leetcode——75. Sort Colors
题目:Given an array with n objects colored red, white or blue, sort them so that objects of the same color are adjacent, with the colors in the order red, white and blue.Here, we will use the integers 0,原创 2017-01-26 14:38:54 · 340 阅读 · 0 评论 -
Leetcode——264. Ugly Number II
题目Write a program to find the n-th ugly number.Ugly numbers are positive numbers whose prime factors only include 2, 3, 5. For example, 1, 2, 3, 4, 5, 6, 8, 9, 10, 12 is the sequence of the first 10 ug原创 2017-01-24 18:20:52 · 443 阅读 · 0 评论 -
Leetcode——313. Super Ugly Number
题目Write a program to find the nth super ugly number.Super ugly numbers are positive numbers whose all prime factors are in the given prime list primes of size k. For example, [1, 2, 4, 7, 8, 13, 14, 16原创 2017-01-24 00:58:37 · 332 阅读 · 0 评论 -
Leetcode——396. Rotate Function
题目Given an array of integers A and let n to be its length.Assume Bk to be an array obtained by rotating the array A k positions clock-wise, we define a "rotation function" F on A as follow:F(k) = 0 * B原创 2017-01-23 18:23:04 · 314 阅读 · 0 评论 -
Leetcode——400. Nth Digit
题目Find the nth digit of the infinite integer sequence 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, ...Note: n is positive and will fit within the range of a 32-bit signed integer (n < 231).Example 1:Input: 3Outp原创 2017-01-23 17:24:06 · 269 阅读 · 0 评论 -
Leetcode——67. Add Binary
问题Given two binary strings, return their sum (also a binary string).For example, a = “11” b = “1” Return “100”.解答*class Solution { public: string addBinary(string a, string b) { int i=0;原创 2017-01-23 00:12:10 · 260 阅读 · 0 评论 -
Leetcode——231. Power of Two
回答Given an integer, write a function to determine if it is a power of two.解答class Solution { public: bool isPowerOfTwo(int n) { int MaxPowerOfTwo=pow(2,(int)(log10(INT_MAX)/log10(2)));原创 2017-01-22 21:02:07 · 261 阅读 · 0 评论 -
Leetcode——171. Excel Sheet Column Number
题目https://leetcode.com/problems/excel-sheet-column-number/解答其实就是26进制转化为十进制class Solution { public: int titleToNumber(string s) { int res=0; for(int i=0;i<s.length();i++) {原创 2017-01-21 23:48:40 · 220 阅读 · 0 评论 -
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?解答Method1:循环或者递归public boolean isPowerOfThree(int n) { r原创 2017-01-21 20:27:38 · 215 阅读 · 0 评论 -
Leetcode——453. Minimum Moves to Equal Array Elements
题目Given a non-empty integer array of size n, find the minimum number of moves required to make all array elements equal, where a move is incrementing n - 1 elements by 1.Example:Input: [1,2,3]Output: 3原创 2017-01-21 16:04:49 · 255 阅读 · 0 评论 -
Leetcode——80. Remove Duplicates from Sorted Array II
题目Follow up for "Remove Duplicates": What if duplicates are allowed at most twice?For example, Given sorted array nums = [1,1,1,2,2,3],Your function should return length = 5, with the first five elemen原创 2017-01-26 22:59:43 · 276 阅读 · 0 评论