07 2015 档案
摘要：Compare two version numbersversion1andversion2.Ifversion1>version2return 1, ifversion1 len(x2): for i in range(len(x1)-len(x2)): ...
阅读全文
摘要：Given an arraynums, there is a sliding window of sizekwhich is moving from the very left of the array to the very right. You can only see theknumbers ...
阅读全文
摘要：Given an array ofnintegers wheren> 1,nums, return an arrayoutputsuch thatoutput[i]is equal to the product of all the elements ofnumsexceptnums[i].Solv...
阅读全文
摘要：Write a function to delete a node (except the tail) in a singly linked list, given only access to that node.Supposed the linked list is 1 -> 2 -> 3 ->...
阅读全文
摘要：Reverse bits of a given 32 bits unsigned integer.For example, given input 43261596 (represented in binary as00000010100101000001111010011100), return ...
阅读全文
摘要：Given a binary tree, find the lowest common ancestor (LCA) of two given nodes in the tree.According to thedefinition of LCA on Wikipedia: “The lowest ...
阅读全文
摘要：Write a SQL query to get the second highest salary from theEmployeetable.+----+--------+| Id | Salary |+----+--------+| 1 | 100 || 2 | 200 || ...
阅读全文
摘要：Given a collection of integers that might contain duplicates,nums, return all possible subsets.Note:Elements in a subset must be in non-descending ord...
阅读全文
摘要：Given a set of distinct integers,nums, return all possible subsets.Note:Elements in a subset must be in non-descending order.The solution set must not...
阅读全文
摘要：Given a binary search tree (BST), find the lowest common ancestor (LCA) of two given nodes in the BST.According to thedefinition of LCA on Wikipedia: ...
阅读全文
摘要：Given a singly linked list, determine if it is a palindrome. Follow up:Could you do it in O(n) time and O(1) space? O(n)空间：存成数组后比较 class Solution: # @
阅读全文
摘要：Given an integern, return the number of trailing zeroes inn!.Note:Your solution should be in logarithmic time complexity.A number multiplied by10will ...
阅读全文
摘要：Given a column title as appear in an Excel sheet, return its corresponding column number.For example: A -> 1 B -> 2 C -> 3 ... Z -> 26 AA -> 27 ...
阅读全文
摘要：Given a positive integer, return its corresponding column title as appear in an Excel sheet.For example: 1 -> A 2 -> B 3 -> C ... 26 ->...
阅读全文
摘要：Given an integer, write a function to determine if it is a power of two.所有为power of two的整数均为 100000... 的形式，减一则会造成所有位相异，即与的结果为0。这里需要排除当n为0的情况，减一后与的结果仍为...
阅读全文
摘要：Given a roman numeral, convert it to an integer.Input is guaranteed to be within the range from 1 to 3999.如果左边字母的值小于右边，则减去左边的，防止溢出，最后一个值一定需要加上去def rom...
阅读全文
摘要：The gray code is a binary numeral system where two successive values differ in only one bit.Given a non-negative integernrepresenting the total number...
阅读全文
摘要：Implement strStr().Returns the index of the first occurrence of needle in haystack, or -1 if needle is not part of haystack.在一个字符串中查找另外一个字符串是否存在。暴力 O(...
阅读全文
摘要：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,...
阅读全文
摘要：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
阅读全文
摘要：Given a binary tree and a sum, determine if the tree has a root-to-leaf path such that adding up all the values along the path equals the given sum.Fo...
阅读全文
摘要：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...
阅读全文
摘要：Source:https://github.com/getify/You-Dont-Know-JS/blob/master/scope%20&%20closures/ch1.mdCommon Compliation StepsTokenizing/Lexing:breaking up a strin...
阅读全文
摘要：Given a binary search tree, write a functionkthSmallestto find thekth smallest element in it.Note:You may assume k is always valid, 1 ≤ k ≤ BST's tota...
阅读全文
摘要：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 intege
阅读全文
摘要：Source:http://tech.pro/tutorial/2011/functional-javascript-part-4-function-curryingCurrying is the process of transforming a function that takes multi...
阅读全文
摘要：Source: https://github.com/getify/You-Dont-Know-JS/blob/master/up%20&%20going/ch2.md#equalityFalse Values in JS""(empty string)0,-0,NaN(invalidnumber)...
阅读全文