2021年1月16日
[LeetCode] 1658. Minimum Operations to Reduce X to Zero
摘要： You are given an integer array nums and an integer x. In one operation, you can either remove the leftmost or the rightmost element from the array num 阅读全文
posted @ 2021-01-16 01:41 CNoodle 阅读(592) 评论(0) 推荐(0)