摘要：
和前面119. Pascal's Triangle非常相似，不赘述，下面是代码 class Solution { public List<Integer> getRow(int row) { List<Integer> yanghui=new ArrayList<Integer>(); for (i 阅读全文
摘要：
Given two sorted integer arrays nums1 and nums2, merge nums2 into nums1 as one sorted array. Note:You may assume that nums1 has enough space (size tha 阅读全文
摘要：
翻译：给定行数，生成Pascal三角的第一行？（应该是所有行，不止第一行） Given numRows, generate the first numRows of Pascal's triangle. For example, given numRows = 5,Return [ [1], [1, 阅读全文
摘要：
翻译：假设你的数组中第i个元素是第i天的股票价格 。你最多只能做一次交易（买进并卖出一支股票，可以不做），设计一个算法来实现利润最大。 Say you have an array for which the ith element is the price of a given stock on d 阅读全文
摘要：
Given a non-negative integer represented as a non-empty array of digits, plus one to the integer. You may assume the integer do not contain any leadin 阅读全文
摘要：
Find the contiguous subarray within an array (containing at least one number) which has the largest sum. For example, given the array [-2,1,-3,4,-1,2, 阅读全文
摘要：
Given a sorted array and a target value, return the index if the target is found. If not, return the index where it would be if it were inserted in or 阅读全文
摘要：
Given an array and a value, remove all instances of that value in-place and return the new length. Do not allocate extra space for another array, you 阅读全文
摘要：
题目 Given a sorted array, remove the duplicates in-place such that each element appear only once and return the new length.Do not allocate extra space 阅读全文
摘要：
源代码百度云链接：http://pan.baidu.com/s/1pLTtbM7 密码：8o2r 深度学习入门选了这篇文章和相应代码，纠结了两三个月，加上师兄讲解，现在才勉强搞懂，写出来，自己总结一下，也希望其他人少走点弯路，之后还会写一篇关于本文代码的博客。由于我是从小白开始的，所以这篇文章会尽可 阅读全文