2020年2月23日
【leetcode】1359. Count All Valid Pickup and Delivery Options
摘要： 题目如下： Given n orders, each order consist in pickup and delivery services. Count all valid pickup/delivery possible sequences such that delivery(i) is 阅读全文
posted @ 2020-02-23 15:18 seyjs 阅读(380) 评论(0) 推荐(0)
【leetcode】1357. Apply Discount Every n Orders
摘要： 题目如下： There is a sale in a supermarket, there will be a discount every n customer.There are some products in the supermarket where the id of the i-th  阅读全文
posted @ 2020-02-23 15:09 seyjs 阅读(300) 评论(0) 推荐(0)
【leetcode】1356. Sort Integers by The Number of 1 Bits
摘要： 题目如下： Given an integer array arr. You have to sort the integers in the array in ascending order by the number of 1's in their binary representation an 阅读全文
posted @ 2020-02-23 15:07 seyjs 阅读(378) 评论(0) 推荐(0)
【leetcode】1354. Construct Target Array With Multiple Sums
摘要： 题目如下： Given an array of integers target. From a starting array, A consisting of all 1's, you may perform the following procedure : let x be the sum of 阅读全文
posted @ 2020-02-23 15:06 seyjs 阅读(295) 评论(0) 推荐(0)
【leetcode】1352. Product of the Last K Numbers
摘要： 题目如下： Implement the class ProductOfNumbers that supports two methods: 1. add(int num) Adds the number num to the back of the current list of numbers. 阅读全文
posted @ 2020-02-23 15:01 seyjs 阅读(307) 评论(0) 推荐(0)