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