摘要：
原题链接在这里：http://www.lintcode.com/en/problem/coins-in-a-line-ii/ 题目： There are n coins with different value in a line. Two players take turns to take on 阅读全文
posted @ 2017-02-16 18:00
Dylan_Java_NYC
阅读(281)
评论(0)
推荐(0)
摘要：
原题链接在这里：http://www.lintcode.com/en/problem/coins-in-a-line/ 题目： There are n coins in a line. Two players take turns to take one or two coins from righ 阅读全文
posted @ 2017-02-16 17:53
Dylan_Java_NYC
阅读(237)
评论(0)
推荐(0)
摘要：
原题链接在这里：http://www.lintcode.com/en/problem/maximum-subarray-ii/ 题目： Given an array of integers, find two non-overlapping subarrays which have the larg 阅读全文
posted @ 2017-02-16 16:02
Dylan_Java_NYC
阅读(1233)
评论(0)
推荐(0)
摘要：
原题链接在这里：http://www.lintcode.com/en/problem/longest-increasing-continuous-subsequence-ii/ 题目： Give you an integer matrix (with row size n, column size 阅读全文
posted @ 2017-02-16 13:08
Dylan_Java_NYC
阅读(741)
评论(0)
推荐(0)
摘要：
原题链接在这里：https://leetcode.com/problems/longest-increasing-subsequence/ 题目： Given an unsorted array of integers, find the length of longest increasing s 阅读全文
posted @ 2017-02-16 11:49
Dylan_Java_NYC
阅读(428)
评论(0)
推荐(0)
摘要：
原题链接在这里：http://www.lintcode.com/en/problem/longest-increasing-continuous-subsequence/ 题目： Give an integer array，find the longest increasing continuous 阅读全文
posted @ 2017-02-16 11:32
Dylan_Java_NYC
阅读(298)
评论(0)
推荐(0)
浙公网安备 33010602011771号