摘要: 1827. 最少操作使数组递增 class Solution { public int minOperations(int[] nums) { int n = nums.length; int res = 0; for(int i = 1; i < n ; i++) { if(nums[i] <= 阅读全文
posted @ 2022-12-11 18:27 Eiffelzero 阅读(36) 评论(0) 推荐(0)