随笔分类 -  algorithm

leetcode 188-maxProfit
摘要：public static int maxProfit(int k, int[] prices) { if (0 >= k || null == prices || 1 >= prices.length) return 0; int r = 0, plen = 0; if (k >= (plen = prices.leng... 阅读全文
posted @ 2018-11-28 15:56 飞叶子 阅读(245) 评论(0) 推荐(0)