代码缩减量
Max(record[i] - record[]j)? i < j
如果數組一直遞增就返回0
package firstexam;/*** @author Ji yongmei* @file null.java* @create 2022-10-14 3:00*/ public class CodeZip {public static int minZip(int[] arr) {int maxProfit = 0;int p = 0;int q = 1;int n = arr.length;while (p < q && p < n && q < n) {if (arr[p] > arr[q]) {maxProfit = Math.max(maxProfit, arr[p] - arr[q]);q++;} else {p = q;q++;}}return maxProfit;}public static void main(String[] args) {System.out.println(minZip(new int[] {365, 400,350,410,300,400,420,370}));System.out.println(minZip(new int[] {15000, 17000,17000,22000}));} }總結
- 上一篇: 黄金实盘点评:价格不宜回调过深
- 下一篇: c++随笔-删除文件