K SUM My Submissions http://www.lintcode.com/en/problem/k-sum/ 题目来自九章算法 13% Accepted Given n distinct positive ...

Subarray Sum Given an integer array, find a subarray where the sum of numbers is zero. Your code should return the index of the first number ...

Given an integer array, find a subarray with sum closest to zero. Return the indexes of the first number and last number. Example Given ...

Maximum Subarray Find the contiguous subarray within an array (containing at least one number) which has the largest sum.For example, given ...

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 ...

Majority Number 原题链接：http://lintcode.com/en/problem/majority-number/# Given an array of integers, the majority number is the number that occurs ...

LeetCode 1 Two Sum 解题报告 偶然间听见leetcode这个平台，这里面题量也不是很多200多题，打算平时有空在研究生期间就刷完，跟跟多的练习算法的人进行交流思想，一定的ACM算法积累可以对以后在对算法中优化带来好处。Ok，今天是我做的第一题Add Two Sum。 题目要求 ...

Longest Common Substring 原题链接： http://lintcode.com/zh-cn/problem/longest-common-substring/# Given two strings, find the longest common ...