[面试]给你一串股票价格,找出买点和卖点,使得利润最大。(Amazon 面试题)
Give array of integers representing historic stock prices. Find the buying and selling points to maximize the profit. int[] stocks = { 2, 3, 15, 23, 45, 1, 32, 42, 21, 45, 23 }; int min = sto
转载
2012-01-03 14:15:42 ·
1468 阅读 ·
1 评论