2017年03月_Chan_Keh

原创 LeetCode : Palindrome Number

Determine whether an integer is a palindrome. Do this without extra space.click to show spoilers.Some hints: Could negative integers be palindromes? (ie, -1)If you are thinking of converting the integ

2017-03-31 14:08:03 230

原创 LeetCode : Factorial Trailing Zeroes

Given an integer n, return the number of trailing zeroes in n!.Note: Your solution should be in logarithmic time complexity.解释：对n!做质因数分解n!=2x*3y*5z*…显然0的个数等于min(x,z)，并且min(x,z)==zclass Solution {pub

2017-03-31 13:58:15 146

原创 LeetCode： Pascal's Triangle II

Given an index k, return the kth row of the Pascal’s triangle.For example, given k = 3, Return [1,3,3,1].Note: Could you optimize your algorithm to use only O(k) extra space?class Solution {public:

2017-03-31 12:00:33 168

原创 LeetCode : Arranging Coins

You have a total of n coins that you want to form in a staircase shape, where every k-th row must have exactly k coins.Given n, find the total number of full staircase rows that can be formed.n is a no

2017-03-30 22:11:56 213

原创 LeetCode : Binary Tree Paths

Given a binary tree, return all root-to-leaf paths.For example, given the following binary tree:1 / \ 2 3 \ 5 All root-to-leaf paths are:[“1->2->5”, “1->3”]/** * Definition for a binary

2017-03-29 22:38:43 233

原创 LeetCode : Number of Segments in a String

Count the number of segments in a string, where a segment is defined to be a contiguous sequence of non-space characters.Please note that the string does not contain any non-printable characters.Exampl

2017-03-29 09:29:50 190

原创 LeetCode : Pascal's Triangle

Given numRows, generate the first numRows of Pascal’s triangle.For example, given numRows = 5, Return[ [1], [1,1], [1,2,1], [1,3,3,1], [1,4,6,4,1] ]class Solution {public: ve

2017-03-28 23:34:10 276

原创 LeetCode ： 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 digits are st

2017-03-28 15:57:30 197

原创 LeetCode : 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: True E

2017-03-27 22:38:09 156

原创 LeetCode : Reverse Vowels of a String

Write a function that takes a string as input and reverse only the vowels of a string.Example 1: Given s = “hello”, return “holle”.Example 2: Given s = “leetcode”, return “leotcede”.Note: The vowels

2017-03-27 21:36:28 206

原创 LeetCode : Power of Four

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 loops/re

2017-03-27 21:25:45 157

原创 LeetCode : Repeated Substring Pattern

Given a non-empty string check if it can be constructed by taking a substring of it and appending multiple copies of the substring together. You may assume the given string consists of lowercase Englis

2017-03-25 22:19:30 222

原创 LeetCode : 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 it in

2017-03-15 17:20:33 151

原创 LeetCode : 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-03-15 16:32:15 181

原创 LeetCode : Path Sum III

Find the number of paths that sum to a given value.The path does not need to start or end at the root or a leaf, but it must go downwards (traveling only from parent nodes to child nodes).The tree has

2017-03-15 16:14:56 236 1

原创 LeetCode : Maximum Subarray

Find the contiguous subarray within an array (containing at least one number) which has the largest sum.For example, given the array [-2,1,-3,4,-1,2,1,-5,4], the contiguous subarray [4,-1,2,1] has the

2017-03-15 11:19:01 206

原创 LeetCode : Search Insert Position

Given a sorted array and a target value, return the index if the target is found. If not, return the index where it would be if it were inserted in order.You may assume no duplicates in the array.Here

2017-03-15 10:50:15 179

原创 LeetCode : 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) { if(n<1) return false; if(n==1) ret

2017-03-14 10:58:22 138

原创 LeetCode : 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?Credits: Special thanks to @dietpepsi for adding this problem a

2017-03-13 23:26:44 176

原创 LeetCode : 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 of i

2017-03-12 21:25:37 220

原创 LeetCode ： Best Time to Buy and Sell Stock

Say you have an array for which the ith element is the price of a given stock on day i.If you were only permitted to complete at most one transaction (ie, buy one and sell one share of the stock), desi

2017-03-07 17:13:35 194

原创 LeetCode : Convert a Number to Hexadecimal

Given an integer, write an algorithm to convert it to hexadecimal. For negative integer, two’s complement method is used.Note:All letters in hexadecimal (a-f) must be in lowercase. The hexadecimal str

2017-03-06 15:56:17 239

原创 LeetCode : Convert Sorted Array to Binary Search Tree

Given an array where elements are sorted in ascending order, convert it to a height balanced BST./** * Definition for a binary tree node. * struct TreeNode { * int val; * TreeNode *left; *

2017-03-06 15:51:13 197

原创 LeetCode : Add Strings

Given two non-negative integers num1 and num2 represented as string, return the sum of num1 and num2.Note:The length of both num1 and num2 is < 5100. Both num1 and num2 contains only digits 0-9. Both

2017-03-05 22:23:23 374

原创 LeetCode : Number of Boomerangs

Given n points in the plane that are all pairwise distinct, a “boomerang” is a tuple of points (i, j, k) such that the distance between i and j equals the distance between i and k (the order of the tup

2017-03-05 21:07:01 204

原创 LeetCode : Intersection of Two Arrays II

Given two arrays, write a function to compute their intersection.Example: Given nums1 = [1, 2, 2, 1], nums2 = [2, 2], return [2, 2].Note: Each element in the result should appear as many times as it

2017-03-04 20:47:45 202

原创 LeetCode : Roman to Integer

Total Accepted: 133406 Total Submissions: 301893 Difficulty: Easy Contributors: Admin Given a roman numeral, convert it to an integer.Input is guaranteed to be within the range from 1 to 3999.class

2017-03-03 15:59:20 168

原创 LeetCode : Contains Duplicate

Given an array of integers, find if the array contains any duplicates. Your function should return true if any value appears at least twice in the array, and it should return false if every element is

2017-03-02 22:40:33 202

原创 LeetCode : 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 is case sensitive, for example “Aa” is not consider

2017-03-02 11:51:46 156

原创 LeetCode : Valid Anagram

Given two strings s and t, write a function to determine if t is an anagram of s.For example, s = “anagram”, t = “nagaram”, return true. s = “rat”, t = “car”, return false.Note: You may assume the s

2017-03-01 17:04:50 176

恩，其实你很菜...