2021年9月12日
Leetcode: 1793. Maximum Score of a Good Subarray
摘要： Description You are given an array of integers nums (0-indexed) and an integer k. The score of a subarray (i, j) is defined as min(nums[i], nums[i+1], 阅读全文
posted @ 2021-09-12 13:46 tmortred 阅读(77) 评论(0) 推荐(0) 编辑