11 2015 档案

摘要:Given an integer n, return the number of trailing zeroes in n!.Note: Your solution should be in logarithmic time complexity.Credits:Special thanks to ... 阅读全文
posted @ 2015-11-29 15:39 0giant 阅读(148) 评论(0) 推荐(0) 编辑
摘要:Given a non-negative number represented as an array of digits, plus one to the number.The digits are stored such that the most significant digit is at... 阅读全文
posted @ 2015-11-26 12:38 0giant 阅读(144) 评论(0) 推荐(0) 编辑
摘要:You are a professional robber planning to rob houses along a street. Each house has a certain amount of money stashed, the only constraint stopping yo... 阅读全文
posted @ 2015-11-26 10:23 0giant 阅读(192) 评论(0) 推荐(0) 编辑
摘要:Given a sorted array, remove the duplicates in place such that each element appear only once and return the new length.Do not allocate extra space for... 阅读全文
posted @ 2015-11-25 14:46 0giant 阅读(158) 评论(0) 推荐(0) 编辑
摘要:Given a binary tree, return the bottom-up level order traversal of its nodes' values. (ie, from left to right, level by level from leaf to root).For e... 阅读全文
posted @ 2015-11-25 10:53 0giant 阅读(174) 评论(0) 推荐(0) 编辑
摘要:Given an array and a value, remove all instances of that value in place and return the new length.The order of elements can be changed. It doesn't mat... 阅读全文
posted @ 2015-11-23 19:20 0giant 阅读(145) 评论(0) 推荐(0) 编辑
摘要:Given a binary tree, check whether it is a mirror of itself (ie, symmetric around its center).For example, this binary tree is symmetric: 1 / \ ... 阅读全文
posted @ 2015-11-23 13:58 0giant 阅读(211) 评论(0) 推荐(0) 编辑
摘要:Given a binary tree, determine if it is height-balanced.For this problem, a height-balanced binary tree is defined as a binary tree in which the depth... 阅读全文
posted @ 2015-11-23 11:08 0giant 阅读(166) 评论(0) 推荐(0) 编辑
摘要:Implement the following operations of a queue using stacks.push(x) -- Push element x to the back of queue.pop() -- Removes the element from in front o... 阅读全文
posted @ 2015-11-22 22:03 0giant 阅读(195) 评论(0) 推荐(0) 编辑
摘要:Given an integer, write a function to determine if it is a power of two.Credits:Special thanks to @jianchao.li.fighter for adding this problem and cre... 阅读全文
posted @ 2015-11-22 22:01 0giant 阅读(152) 评论(0) 推荐(0) 编辑
摘要:Merge two sorted linked lists and return it as a new list. The new list should be made by splicing together the nodes of the first two lists.Subscribe... 阅读全文
posted @ 2015-11-22 16:55 0giant 阅读(121) 评论(0) 推荐(0) 编辑
摘要: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... 阅读全文
posted @ 2015-11-19 17:40 0giant 阅读(190) 评论(0) 推荐(0) 编辑
摘要:You are climbing a stair case. It takes n steps to reach to the top.Each time you can either climb 1 or 2 steps. In how many distinct ways can you cli... 阅读全文
posted @ 2015-11-19 15:24 0giant 阅读(124) 评论(0) 推荐(0) 编辑
摘要:Given a sorted linked list, delete all duplicates such that each element appear only once.For example, Given 1->1->2, return 1->2. Given 1->1->2->3->3... 阅读全文
posted @ 2015-11-18 14:10 0giant 阅读(166) 评论(0) 推荐(0) 编辑
摘要:Reverse a singly linked list对于这种可以修改值的,把值逆序就可以了。。。。用vector存,然后逆序读。都忘了指针怎么赋值初始化了。*p=&head; 1 /** 2 * Definition for singly-linked list. 3 * struct Li... 阅读全文
posted @ 2015-11-17 19:03 0giant 阅读(158) 评论(0) 推荐(0) 编辑
摘要:Given a roman numeral, convert it to an integer.Input is guaranteed to be within the range from 1 to 3999.题目虽短,但是难度还是在那里的。首先,我们需要明白罗马数字是怎么计数的,当你明白了这个就... 阅读全文
posted @ 2015-11-17 17:03 0giant 阅读(210) 评论(0) 推荐(0) 编辑
摘要:Given an array of size n, find the majority element. The majority element is the element that appears more than ⌊ n/2 ⌋ times.You may assume that the ... 阅读全文
posted @ 2015-11-16 16:12 0giant 阅读(201) 评论(0) 推荐(0) 编辑
摘要:---恢复内容开始---【一】一共有n个人,有m条跳绳,我们如何分配组以及组员数,使得每组的人数相差最少,例如输入9个人,8条跳绳,最佳分配是5,4;刚开始并没有理解题的意思,情急之下,百度为上。看到一道和这道题非常类似的题目。输入两个数,人数为n,跳绳数为m。首先,加入人数小于m分成1组就好了,如... 阅读全文
posted @ 2015-11-16 13:07 0giant 阅读(532) 评论(0) 推荐(0) 编辑
摘要: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 i... 阅读全文
posted @ 2015-11-16 10:23 0giant 阅读(157) 评论(0) 推荐(0) 编辑
摘要: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 arr... 阅读全文
posted @ 2015-11-13 13:13 0giant 阅读(179) 评论(0) 推荐(0) 编辑
摘要: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 = ... 阅读全文
posted @ 2015-11-12 17:18 0giant 阅读(184) 评论(0) 推荐(0) 编辑
摘要:Given an array nums, write a function to move all 0's to the end of it while maintaining the relative order of the non-zero elements.For example, give... 阅读全文
posted @ 2015-11-12 15:55 0giant 阅读(247) 评论(0) 推荐(0) 编辑
摘要:Given two binary trees, write a function to check if they are equal or not.Two binary trees are considered equal if they are structurally identical an... 阅读全文
posted @ 2015-11-11 15:59 0giant 阅读(182) 评论(0) 推荐(0) 编辑
摘要:Given an integer array nums, find the sum of the elements between indices i and j (i ≤ j), inclusive.Example:Given nums = [-2, 0, 3, -5, 2, -1]sumRang... 阅读全文
posted @ 2015-11-11 15:13 0giant 阅读(139) 评论(0) 推荐(0) 编辑
摘要:Invert a binary tree. 4 / \ 2 7 / \ / \1 3 6 9to 4 / \ 7 2 / \ / \9 6 3 1比较简单,二叉树里的题其实有点举一反三的意思,很多题会一道就差不多了。递归的反... 阅读全文
posted @ 2015-11-09 16:24 0giant 阅读(134) 评论(0) 推荐(0) 编辑
摘要:Write a SQL query to delete all duplicate email entries in a table named Person, keeping only unique emails based on its smallest Id.+----+-----------... 阅读全文
posted @ 2015-11-09 16:08 0giant 阅读(250) 评论(0) 推荐(0) 编辑
摘要:Find the contiguous subarray within an array (containing at least one number) which has the largest product.For example, given the array [2,3,-2,4], t... 阅读全文
posted @ 2015-11-09 15:12 0giant 阅读(180) 评论(0) 推荐(0) 编辑
摘要:Given a binary tree, imagine yourself standing on the right side of it, return the values of the nodes you can see ordered from top to bottom.For exam... 阅读全文
posted @ 2015-11-06 14:32 0giant 阅读(195) 评论(0) 推荐(0) 编辑
摘要: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 c... 阅读全文
posted @ 2015-11-04 19:18 0giant 阅读(184) 评论(0) 推荐(0) 编辑
摘要:Related to question Excel Sheet Column TitleGiven a column title as appear in an Excel sheet, return its corresponding column number.For example: A... 阅读全文
posted @ 2015-11-03 22:53 0giant 阅读(160) 评论(0) 推荐(0) 编辑
摘要:我发现最近做题,我总是被“阵势”唬住,不管什么题,就先觉得自己不会了,不想去思考,这种习惯比较可怕。其实任何难题,只要你学会分解它,并逐一击破,其实你发现你是可以解决的。就像这道题,一个是要“删去”非正常字符例如':空格呀什么的,最后要的只有数字和字符。所以要有一个函数判断是否有效isValid。还... 阅读全文
posted @ 2015-11-02 16:43 0giant 阅读(203) 评论(0) 推荐(0) 编辑
摘要:又一道二维数组上的题,昨天刚开始的时候leetcode上不去了,就去牛客上面随便瞅瞅,当时看着道题就觉得,有些难度,二维数组说实话我一看到就怂。题目描述在一个二维数组中,每一行都按照从左到右递增的顺序排序,每一列都按照从上到下递增的顺序排序。请完成一个函数,输入这样的一个二维数组和一个整数,判断数组... 阅读全文
posted @ 2015-11-02 10:04 0giant 阅读(287) 评论(0) 推荐(1) 编辑
摘要:对于Vector的用法,实在是知道的太少,算法思想比较简单,核心也就一行代码,但是实现错误就显示平时代码的不熟悉。Given numRows, generate the first numRows of Pascal's triangle.For example, given numRows = 5... 阅读全文
posted @ 2015-11-01 16:41 0giant 阅读(277) 评论(0) 推荐(0) 编辑