Lintcode: Subarray Sum 解题报告
Subarray Sum 原题链接：http://lintcode.com/zh-cn/problem/subarray-sum/# Given an integer array, find a subarray where the sum of numbers is zero. Your ...
原文：Lintcode: Minimum Adjustment Cost 解题报告
Minimum Adjustment Cost Given an integer array, adjust each integers so that the difference of every adjcent integers are not greater than a given number target. If the array before adjustment is A, t ...
2014-12-09 18:47 7 6083 推荐指数：
相关推荐
Lintcode: Fast Power 解题报告
Fast Power 原题链接：http://lintcode.com/en/problem/fast-power/# Calculate the an % b where a, b and n are all 32bit integers. Example For 231 ...
lintcode: k Sum 解题报告
K SUM My Submissions http://www.lintcode.com/en/problem/k-sum/ 题目来自九章算法 13% Accepted Given n distinct positive ...
Lintcode: Majority Number 解题报告
Majority Number 原题链接：http://lintcode.com/en/problem/majority-number/# Given an array of integers, the majority number is the number that occurs ...
Lintcode: Longest Common Substring 解题报告
Longest Common Substring 原题链接： http://lintcode.com/zh-cn/problem/longest-common-substring/# Given two strings, find the longest common ...
Lintcode: First Bad Version 解题报告
First Bad Version http://lintcode.com/en/problem/first-bad-version The code base version is an integer and start from 1 to n. One day ...
Lintcode: Majority Number II 解题报告
Majority Number II 原题链接： http://lintcode.com/en/problem/majority-number-ii/# Given an array of integers, the majority number is the number ...
[LintCode] 597 Subtree with Maximum Average 解题报告
DescriptionGiven a binary tree, find the subtree with maximum average. Return the root of the subtre ...