数字题型
POFEI_IS_SHIT
不是我针对谁,在座的各位都是垃圾
展开
-
172. Factorial Trailing Zeroes
Given an integer n, return the number of trailing zeroes in n!.Note: Your solution should be in logarithmic time complexity.《编程之美》2.2不要被阶乘吓到。class Solution { public: int trailingZeroes(int n) {原创 2017-07-11 14:45:11 · 155 阅读 · 0 评论 -
216. Combination Sum III
Find all possible combinations of k numbers that add up to a number n, given that only numbers from 1 to 9 can be used and each combination should be a unique set of numbers.Example 1:Input: k = 3, n =原创 2017-02-24 11:19:24 · 202 阅读 · 0 评论 -
40. Combination Sum II
Given a collection of candidate numbers (C) and a target number (T), find all unique combinations in C where the candidate numbers sums to T.Each number in C may only be used once in the combination.No原创 2017-07-31 11:05:36 · 155 阅读 · 0 评论 -
137. Single Number II
Given an array of integers, every element appears three times except for one, which appears exactly once. Find that single one.一道挺有意思的题目。class Solution { public: int singleNumber(vector<int>& nums)原创 2017-01-20 22:28:54 · 166 阅读 · 0 评论 -
136. Single Number
Given an array of integers, every element appears twice except for one. Find that single one.Note: Your algorithm should have a linear runtime complexity. Could you implement it without using extra me原创 2017-01-20 11:11:45 · 163 阅读 · 0 评论 -
191. Number of 1 Bits
Write a function that takes an unsigned integer and returns the number of ’1’ bits it has (also known as the Hamming weight).For example, the 32-bit integer ’11’ has binary representation 0000000000000原创 2017-02-04 10:53:26 · 171 阅读 · 0 评论 -
9. Palindrome Number
Determine whether an integer is a palindrome. Do this without extra space.题意:判断给定数字是否回文,数字题型注意溢出,负数,和整百数class Solution { public: bool isPalindrome(int x) { if(x < 0) return false; l原创 2017-06-11 11:39:26 · 153 阅读 · 0 评论 -
7. Reverse Integer
Reverse digits of an integer.Example1: x = 123, return 321 Example2: x = -123, return -321题意:翻转数字,细节:溢出输出0,10,100,1000等等输出1class Solution { public: int reverse(int x) { int sym = 1;原创 2017-06-10 21:39:01 · 175 阅读 · 0 评论 -
190. Reverse Bits
Reverse bits of a given 32 bits unsigned integer.For example, given input 43261596 (represented in binary as 00000010100101000001111010011100), return 964176192 (represented in binary as 00111001011110原创 2017-02-04 10:50:36 · 180 阅读 · 0 评论 -
39. Combination Sum
Given a set of candidate numbers (C) (without duplicates) and a target number (T), find all unique combinations in C where the candidate numbers sums to T.The same repeated number may be chosen from C原创 2017-07-31 10:48:48 · 485 阅读 · 0 评论