lintCode
文章平均质量分 75
LimingLiuLiming
这个作者很懒,什么都没留下…
展开
-
Product of Array Exclude Itself
Given an integers array A.Define B[i] = A[0] * ... * A[i-1] * A[i+1] * ... * A[n-1], calculate B WITHOUT divide operation.Have you met this question in a real interview? YesExamp原创 2015-08-09 15:35:00 · 461 阅读 · 0 评论 -
Delete Digits
Given string A representative a positive integer which has N digits, remove any k digits of the number, the remaining digits are arranged according to the original order to become a new positive integ原创 2015-09-07 20:20:05 · 534 阅读 · 0 评论 -
Recover Rotated Sorted Array
Given a rotated sorted array, recover it to sorted array in-place.Have you met this question in a real interview? YesExample[4, 5, 1, 2, 3] -> [1, 2, 3, 4, 5]Challenge原创 2015-08-05 15:49:29 · 433 阅读 · 0 评论 -
Subtree
You have two every large binary trees: T1, with millions of nodes, and T2, with hundreds of nodes. Create an algorithm to decide if T2 is a subtree of T1.Have you met this question in a real原创 2015-08-05 11:15:43 · 531 阅读 · 0 评论 -
Continuous Subarray Sum II
Given an integer array, find a continuous rotate subarray where the sum of numbers is the biggest. Your code should return the index of the first number and the index of the last number. (If their are原创 2015-09-01 10:35:53 · 675 阅读 · 0 评论 -
Flip Bits
Determine the number of bits required to flip if you want to convert integer n to integer m.Have you met this question in a real interview? YesExampleGiven n = 31 (11111), m = 14原创 2015-08-05 14:49:47 · 785 阅读 · 0 评论 -
strStr
strstr (a.k.a find sub string), is a useful function in string operation. Your task is to implement this function.For a given source string and a target string, you should output the firstindex(fr原创 2015-08-12 18:50:21 · 1152 阅读 · 0 评论 -
Balanced Binary Tree
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 of the two subtrees of every node never diffe原创 2015-08-24 20:24:55 · 481 阅读 · 0 评论 -
Best Time to Buy and Sell Stock III
Say you have an array for which the ith element is the price of a given stock on day i.Design an algorithm to find the maximum profit. You may complete at most twotransactions.Have you met t原创 2015-08-24 22:30:37 · 427 阅读 · 0 评论 -
Triangle
Given a triangle, find the minimum path sum from top to bottom. Each step you may move to adjacent numbers on the row below.Have you met this question in a real interview? YesExamp原创 2015-08-09 15:14:54 · 405 阅读 · 0 评论 -
Set Matrix Zeroes
Given a m x n matrix, if an element is 0, set its entire row and column to 0. Do it in place.Have you met this question in a real interview? YesExampleGiven a matrix[ [1,2],原创 2015-10-06 21:50:43 · 657 阅读 · 0 评论