seyjs - 博客园

2020年7月1日

【leetcode】1491. Average Salary Excluding the Minimum and Maximum Salary

摘要：题目如下： Given an array of unique integers salary where salary[i] is the salary of the employee i. Return the average salary of employees excluding the m 阅读全文

posted @ 2020-07-01 10:09 seyjs 阅读(338) 评论(0) 推荐(0) 编辑

【leetcode】1488. Avoid Flood in The City

摘要：题目如下： Your country has an infinite number of lakes. Initially, all the lakes are empty, but when it rains over the nth lake, the nth lake becomes full 阅读全文

posted @ 2020-07-01 10:05 seyjs 阅读(220) 评论(0) 推荐(0) 编辑

2020年6月22日

【leetcode】1486. XOR Operation in an Array

摘要：题目如下： Given an integer n and an integer start. Define an array nums where nums[i] = start + 2*i (0-indexed) and n == nums.length. Return the bitwise X 阅读全文

posted @ 2020-06-22 14:26 seyjs 阅读(362) 评论(0) 推荐(0) 编辑

【leetcode】1481. Least Number of Unique Integers after K Removals

摘要：题目如下： Given an array of integers arr and an integer k. Find the least number of unique integers after removing exactly k elements. Example 1: Input: a 阅读全文

posted @ 2020-06-22 14:22 seyjs 阅读(279) 评论(0) 推荐(0) 编辑

【leetcode】1480. Running Sum of 1d Array

摘要：题目如下： Given an array nums. We define a running sum of an array as runningSum[i] = sum(nums[0]…nums[i]). Return the running sum of nums. Example 1: Inp 阅读全文

posted @ 2020-06-22 14:18 seyjs 阅读(579) 评论(0) 推荐(0) 编辑

【leetcode】1466. Reorder Routes to Make All Paths Lead to the City Zero

摘要：题目如下： There are n cities numbered from 0 to n-1 and n-1 roads such that there is only one way to travel between two different cities (this network for 阅读全文

posted @ 2020-06-22 14:11 seyjs 阅读(366) 评论(0) 推荐(0) 编辑

【leetcode】1465. Maximum Area of a Piece of Cake After Horizontal and Vertical Cuts

摘要：题目如下： Given a rectangular cake with height h and width w, and two arrays of integers horizontalCuts and verticalCuts where horizontalCuts[i] is the di 阅读全文

posted @ 2020-06-22 14:04 seyjs 阅读(363) 评论(0) 推荐(0) 编辑

【leetcode】1464. Maximum Product of Two Elements in an Array

摘要：题目如下： Given the array of integers nums, you will choose two different indices i and j of that array. Return the maximum value of (nums[i]-1)*(nums[j]- 阅读全文

posted @ 2020-06-22 14:01 seyjs 阅读(347) 评论(0) 推荐(0) 编辑

2020年6月13日

【leetcode】1461. Check If a String Contains All Binary Codes of Size K

摘要：题目如下： Given a binary string s and an integer k. Return True if every binary code of length k is a substring of s. Otherwise, return False. Example 1: 阅读全文

posted @ 2020-06-13 09:40 seyjs 阅读(324) 评论(0) 推荐(0) 编辑

2020年6月5日

【leetcode】1460. Make Two Arrays Equal by Reversing Sub-arrays

摘要：题目如下： Given two integer arrays of equal length target and arr. In one step, you can select any non-empty sub-array of arr and reverse it. You are allo 阅读全文

posted @ 2020-06-05 09:28 seyjs 阅读(349) 评论(0) 推荐(0) 编辑

公告