LeetCode

445 篇文章1 人追蹤
看板篩選

153. Find Minimum in Rotated Sorted Array 解題紀錄

Suppose an array of length n sorted in ascending order is rotated between 1 and n times. For example

3969. Valid Subarrays With Matching Sum Digits I 解題紀錄

You are given an integer array nums and an integer digit x.,A subarray nums[l..r] is considered vali

2144. Minimum Cost of Buying Candies With Discount 解題紀錄

A shop is selling candies at a discount. For every two candies sold, the shop gives a third candy fo

沒有更多內容囉!