摘要：
Your are given an array of integers prices, for which the i-th element is the price of a given stock on day i; and a non-negative integer fee represen 阅读全文
摘要：
Given two integer arrays A and B, return the maximum length of an subarray that appears in both arrays. Example 1: Note: 从A串的结尾开始向前遍历，记当前pos为i。 对每一个i， 阅读全文
摘要：
Given an integer array nums, find the sum of the elements between indices i and j (i ≤ j), inclusive. Example: Note: 不是很懂这道题的意义....然后java写多了和cpp的语法有点混 阅读全文
摘要：
You are a professional robber planning to rob houses along a street. Each house has a certain amount of money stashed, the only constraint stopping yo 阅读全文
摘要：
安装时分完盘后提示：“分配到/的分区开始于3584字节,使用磁盘的最小对齐,这可能造成非常差的性能..." 解决办法： 回到windows使用分区助手等工具先分好盘而不是在安装时分盘（这样分完盘后陌生人的时4K对齐，即可解决问题） 这样的话在安装时直接点击分好的盘的修改选项即可。 安装成功后在启动项 阅读全文
摘要：
Say you have an array for which the ith element is the price of a given stock on day i. If you were only permitted to complete at most one transaction 阅读全文