02 2020 档案

【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 阅读(301) 评论(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 阅读(308) 评论(0) 推荐(0)
【leetcode】1351. Count Negative Numbers in a Sorted Matrix
摘要：题目如下： Given a m * n matrix grid which is sorted in non-increasing order both row-wise and column-wise. Return the number of negative numbers in grid. 阅读全文
posted @ 2020-02-19 09:12 seyjs 阅读(351) 评论(0) 推荐(0)
【leetcode】1342. Number of Steps to Reduce a Number to Zero
摘要：题目如下： Given a non-negative integer num, return the number of steps to reduce it to zero. If the current number is even, you have to divide it by 2, ot 阅读全文
posted @ 2020-02-09 17:31 seyjs 阅读(374) 评论(0) 推荐(0)
【leetcode】1343. Number of Sub-arrays of Size K and Average Greater than or Equal to Threshold
摘要：题目如下： Given an array of integers arr and two integers k and threshold. Return the number of sub-arrays of size k and average greater than or equal to  阅读全文
posted @ 2020-02-09 17:28 seyjs 阅读(199) 评论(0) 推荐(0)
【leetcode】1344. Angle Between Hands of a Clock
摘要：题目如下： Given two numbers, hour and minutes. Return the smaller angle (in sexagesimal units) formed between the hour and the minute hand. Example 1: Inp 阅读全文
posted @ 2020-02-09 17:27 seyjs 阅读(326) 评论(0) 推荐(0)
【leetcode】1346. Check If N and Its Double Exist
摘要：题目如下： Given an array arr of integers, check if there exists two integers N and M such that N is the double of M ( i.e. N = 2 * M). More formally check 阅读全文
posted @ 2020-02-09 17:24 seyjs 阅读(559) 评论(0) 推荐(0)
【leetcode】1347. Minimum Number of Steps to Make Two Strings Anagram
摘要：题目如下： Given two equal-size strings s and t. In one step you can choose any character of t and replace it with another character. Return the minimum nu 阅读全文
posted @ 2020-02-09 17:23 seyjs 阅读(319) 评论(0) 推荐(0)
【leetcode】1348. Tweet Counts Per Frequency
摘要：题目如下： Implement the class TweetCounts that supports two methods: 1. recordTweet(string tweetName, int time) Stores the tweetName at the recorded time  阅读全文
posted @ 2020-02-09 17:20 seyjs 阅读(249) 评论(0) 推荐(0)
【leetcode】1340. Jump Game V
摘要：题目如下： Given an array of integers arr and an integer d. In one step you can jump from index i to index: i + x where: i + x < arr.length and 0 < x <= d. 阅读全文
posted @ 2020-02-08 14:26 seyjs 阅读(411) 评论(0) 推荐(0)
【leetcode】1338. Reduce Array Size to The Half
摘要：题目如下： Given an array arr. You can choose a set of integers and remove all the occurrences of these integers in the array. Return the minimum size of t 阅读全文
posted @ 2020-02-08 14:16 seyjs 阅读(439) 评论(0) 推荐(0)
【leetcode】1337. The K Weakest Rows in a Matrix
摘要：题目如下： Given a m * n matrix mat of ones (representing soldiers) and zeros (representing civilians), return the indexes of the k weakest rows in the mat 阅读全文
posted @ 2020-02-08 14:11 seyjs 阅读(360) 评论(0) 推荐(0)