Lintcode: Sort Colors II 解题报告
Sort Colors II 原题链接： http://lintcode.com/zh-cn/problem/sort-colors-ii/# Given an array of n objec ...
花费 19 ms
lintcode: k Sum 解题报告
K SUM My Submissions http://www.lintcode.com/en/problem/k-sum/ 题目来自九章算法 13% ...
Lintcode: Minimum Adjustment Cost 解题报告
Minimum Adjustment Cost Given an integer array, adjust each integers so that the difference of e ...
Lintcode: Kth Largest Element 解题报告
Kth Largest Element Find K-th largest element in an array. Note You can swap elements in t ...
Lintcode: First Bad Version 解题报告
First Bad Version http://lintcode.com/en/problem/first-bad-version The code base version is ...
【刷题】二叉树非递归遍历
原题链接： binary-tree-preorder-traversal binary-tree-inorder-traversal binary-tree-postorder-tra ...
Lintcode: Fast Power 解题报告
Fast Power 原题链接：http://lintcode.com/en/problem/fast-power/# Calculate the an % b where a, b and n ...
Lintcode: Backpack
DP. boolean d[i][j]: For the first i items, can we fill a backpack of size j? true or false ...
Lintcode: Subarray Sum 解题报告
Subarray Sum 原题链接：http://lintcode.com/zh-cn/problem/subarray-sum/# Given an integer array, find a ...
Lintcode: A+B problem
直接+没什么好说的，关键在于不用+的操作： 考验Bit Operation, 可以用按位^异或两个操作数对应位以及carry，只是carry是1还是0需要分情况讨论。求更优的解法 ...