S個人牆佛朗火箭製造基5/15153. Find Minimum in Rotated Sorted Array 解題紀錄Suppose an array of length n sorted in ascending order is rotated between 1 and n times. For example101
S個人牆佛朗火箭製造基6/213969. 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 vali100
S個人牆佛朗火箭製造基6/12144. 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 fo1001
