Math
文章平均质量分 89
konsy_dong
Java,C++,Python,linux
展开
-
LeetCode 66. Plus One
Given a non-negative integer represented as a non-empty array of digits, plus one to the integer.You may assume the integer do not contain any leading zero, except the number 0 itself.The digi原创 2017-03-16 13:13:40 · 783 阅读 · 0 评论 -
LeetCode 204. Count Primes
题目 : Count the number of prime numbers less than a non-negative number, n.思路: 求比n小的素数的个数,具体思路见程序注释。但是代码还需要优化~代码:class Solution {public: vector<int> pvec; int countPrimes(int n) { int原创 2017-04-12 13:56:39 · 265 阅读 · 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原创 2017-05-01 11:26:00 · 400 阅读 · 0 评论 -
LeetCode 7. Reverse Integer
题目: Reverse digits of an integer.Example1: x = 123, return 321 Example2: x = -123, return -321Note: The input is assumed to be a 32-bit signed integer. Your function should return 0 when the reverse原创 2017-05-15 08:38:17 · 225 阅读 · 0 评论 -
LeetCode 12. Integer to Roman
题目: Given an integer, convert it to a roman numeral.Input is guaranteed to be within the range from 1 to 3999.思路: 就是将十进制数转成罗马数字,因为只要求到3999,所以就采用了类似于穷举的方法,将千、百、十、个 各个位上的数字对应的罗马数字列举了出来,利用求余的方法,将各个位上的数字原创 2017-05-15 08:39:02 · 232 阅读 · 0 评论 -
LeetCode 13. Roman to Integer
题目: Given a roman numeral, convert it to an integer.Input is guaranteed to be within the range from 1 to 3999.思路: 就是将罗马数字转成十进制数,主要是考虑类似于9、90这种特殊情况。代码:class Solution {public: int romanToInt(strin原创 2017-05-15 08:39:55 · 239 阅读 · 0 评论 -
LeetCode 2. Add Two Numbers
题目: You are given two non-empty linked lists representing two non-negative integers. The digits are stored in reverse order and each of their nodes contain a single digit. Add the two numbers and retu原创 2017-04-26 16:40:40 · 316 阅读 · 0 评论 -
LeetCode 628. Maximum Product of Three Numbers
题目: Given an integer array, find three numbers whose product is maximum and output the maximum product.Example 1:Input: [1,2,3]Output: 6Example 2:Input: [1,2,3,4]Output: 24Note: 1. The length of th原创 2017-07-16 15:37:53 · 556 阅读 · 0 评论 -
LeetCode 535. Encode and Decode TinyURL
题目: Note: This is a companion problem to the System Design problem: Design TinyURL. TinyURL is a URL shortening service where you enter a URL such as https://leetcode.com/problems/design-tinyurl and原创 2017-07-17 00:18:17 · 666 阅读 · 0 评论 -
华为机试——求int型正整数在内存中存储时1的个数
题目描述输入一个int型的正整数,计算出该int型数据在内存中存储时1的个数。 输入描述: **输入一个整数(int类型) 输出描述:** 这个数转换成2进制后,输出1的个数 示例1输入5输出2思路:当前数如果除以2余数不为零,证明有一个1代码:#include <iostream> using namespace std;int main(){ int input;原创 2017-07-29 20:43:07 · 393 阅读 · 0 评论 -
华为机试——质数因子
题目描述功能:输入一个正整数,按照从小到大的顺序输出它的所有质数的因子(如180的质数因子为2 2 3 3 5 ) 最后一个数后面也要有空格输入描述: 输入一个long型整数 输出描述: 按照从小到大的顺序输出它的所有质数的因子,以空格隔开。最后一个数后面也要有空格。 示例1 输入180输出2 2 3 3 5思路:这题的接口是java的,直接不用,输出正确就可以了,i从2开始遍历,到ul原创 2017-07-23 16:13:48 · 688 阅读 · 0 评论 -
华为机试——取近似值
题目描述写出一个程序,接受一个正浮点数值,输出该数值的近似整数值。如果小数点后数值大于等于5,向上取整;小于5,则向下取整。 输入描述: 输入一个正浮点数值 输出描述: 输出该数值的近似整数值 示例1 输入5.5输出6思路: 其实讲道理这就是要round()函数 ,但是华为的编译器不支持。如果这个数与它整数部分相减大于等于0.5,输出整数部分加1;如果输出整数部分。代码:#include原创 2017-07-23 16:33:49 · 492 阅读 · 0 评论 -
华为机试——提取不重复的整数
题目描述输入一个int型整数,按照从右向左的阅读顺序,返回一个不含重复数字的新的整数。 输入描述: 输入一个int型整数 输出描述: 按照从右向左的阅读顺序,返回一个不含重复数字的新的整数 示例1 输入9876673输出37689思路:首先我要说的是这题的测试用例根本不全,如8780我估计它是返回087(正常肯定是87啊),例如2050342估计返回243050(正常返回24305),因原创 2017-07-26 21:33:59 · 510 阅读 · 0 评论 -
LeetCode 413. Arithmetic Slices
题目: A sequence of number is called arithmetic if it consists of at least three elements and if the difference between any two consecutive elements is the same.For example, these are arithmetic sequenc原创 2017-08-27 21:19:41 · 205 阅读 · 0 评论 -
LeetCode 69. Sqrt(x)
题目: Implement int sqrt(int x). Compute and return the square root of x.思路: 写一个自己的求平方根的函数。 初始化low为0,high为x,mid为(high-low)/2+low。如果mid的平方不为x,如果mid的平方大于x面mid-1的平方小于x,直接返回mid-1,其实是没有平方根,就返回小的数;如果mid的平方原创 2017-04-19 11:47:39 · 268 阅读 · 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]Out原创 2017-04-12 14:18:03 · 264 阅读 · 0 评论 -
用srand时间数种子来生成随机数
没有废话直接上代码#include <iostream>#include <vector>#include <ctime>#include <iomanip>using namespace std;int main(){ srand(unsigned(time(0)));//时间种子 vector<int> ivec; int count = 0; for (i原创 2017-03-26 16:31:06 · 3350 阅读 · 0 评论 -
《剑指Offer》斐波那契数列
题目描述 大家都知道斐波那契数列,现在要求输入一个整数n,请你输出斐波那契数列的第n项。 n<=39思路:这个题太简单了,思路不说了1. 递归方法:class Solution {public: int Fibonacci(int n) { if (n == 0 ){ return 0; } else if(n=原创 2017-03-25 11:05:39 · 342 阅读 · 0 评论 -
LeetCode 202. Happy Number
题目: Write an algorithm to determine if a number is “happy”.A happy number is a number defined by the following process: Starting with any positive integer, replace the number by the sum of the squares原创 2017-04-04 16:22:09 · 244 阅读 · 0 评论 -
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 dig原创 2017-04-04 16:26:03 · 292 阅读 · 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?思路: 判断一个数是否是3的幂,但是不建议用循环和递归。想到了用log函数,因为如果n是3的幂,那么log3(n)肯原创 2017-04-06 16:48:59 · 323 阅读 · 0 评论 -
《剑指Offer》 数值的整数次方
题目描述: 我们可以用2*1的小矩形横着或者竖着去覆盖更大的矩形。请问用n个2*1的小矩形无重叠地覆盖一个2*n的大矩形,总共有多少种方法?思路: 这题和前面的那道跳台阶是一模一样的题,也是动态规划,这里的2*1的小矩形横着放就是跳2阶,竖着放就是跳1阶,当大矩形长度小于等于2时,方法数量为长度本身;当大于2时,即为d[i]=d[i-1]+d[i-2],但是递归调用太耗时,就用迭代。代码:cla原创 2017-04-06 20:35:08 · 339 阅读 · 1 评论 -
LeetCode 231. Power of Two
题目: Given an integer, write a function to determine if it is a power of two.思路: 判断一个数是否是2的幂 2的N次幂的特点:仅有首位为1,其余各位都为0 代码:class Solution {public: bool isPowerOfTwo(int n) { return (n>0)原创 2017-04-04 16:23:32 · 278 阅读 · 0 评论 -
LeetCode 268. Missing Number
题目: Given an array containing n distinct numbers taken from 0, 1, 2, …, n, find the one that is missing from the array.For example, Given nums = [0, 1, 3] return 2.Note: Your algorithm should run in原创 2017-04-06 16:47:46 · 229 阅读 · 0 评论 -
LeetCode 263. Ugly Number
题目: 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原创 2017-04-08 14:58:53 · 261 阅读 · 0 评论 -
LeetCode 367. Valid Perfect Square
题目: Given a positive integer num, write a function which returns True if num is a perfect square else False.Note: Do not use any built-in library function such as sqrt.Example 1: Input: 16 Returns:原创 2017-04-08 14:59:51 · 367 阅读 · 0 评论 -
LeetCode 507. Perfect Number
题目: We define the Perfect Number is a positive integer that is equal to the sum of all its positive divisors except itself.Now, given an integer n, write a function that returns true when it is a perf原创 2017-04-10 14:53:14 · 376 阅读 · 0 评论 -
LeetCode 9. Palindrome Number
题目: Determine whether an integer is a palindrome. Do this without extra space.思路: 设置一个与x相等的num,因为要留着x的原始值与sum比较,如果num还大于0,将num除以10的余数与sum乘以10的和的结果赋给sum,然后num除以10。循环完后,如果最后sum和x相等,就是回访数;否则不是。其实就是计算了它的原创 2017-04-10 15:45:30 · 395 阅读 · 0 评论 -
LeetCode 168. Excel Sheet Column Title
题目 : Given a positive integer, return its corresponding column title as appear in an Excel sheet.For example:1 -> A2 -> B3 -> C...26 -> Z27 -> AA28 -> AB 思路: 主要判断的是当前的数是否是27,是否是26的倍数,和其它。三种情况,原创 2017-04-10 18:54:53 · 506 阅读 · 0 评论 -
LeetCode 523. Continuous Subarray Sum
题目: Given a list of non-negative numbers and a target integer k, write a function to check if the array has a continuous subarray of size at least 2 that sums up to the multiple of k, that is, sums up原创 2017-09-20 16:40:32 · 380 阅读 · 0 评论