seyjs - 博客园

2021年6月25日

【leetcode】1619. Mean of Array After Removing Some Elements

摘要：题目如下： Given an integer array arr, return the mean of the remaining integers after removing the smallest 5% and the largest 5% of the elements. Answers 阅读全文

posted @ 2021-06-25 15:23 seyjs 阅读(71) 评论(0) 推荐(0)

【leetcode】1609. Even Odd Tree

摘要：题目如下： A binary tree is named Even-Odd if it meets the following conditions: The root of the binary tree is at level index 0, its children are at level 阅读全文

posted @ 2021-06-25 15:21 seyjs 阅读(50) 评论(0) 推荐(0)

2021年5月21日

【leetcode】1608. Special Array With X Elements Greater Than or Equal X

摘要：题目如下： You are given an array nums of non-negative integers. nums is considered special if there exists a number x such that there are exactly x number 阅读全文

posted @ 2021-05-21 17:22 seyjs 阅读(144) 评论(0) 推荐(0)

【leetcode】1603. Design Parking System

摘要：题目如下： Design a parking system for a parking lot. The parking lot has three kinds of parking spaces: big, medium, and small, with a fixed number of slo 阅读全文

posted @ 2021-05-21 17:16 seyjs 阅读(91) 评论(0) 推荐(0)

【leetcode】1598. Crawler Log Folder

摘要：题目如下： The Leetcode file system keeps a log each time some user performs a change folder operation. The operations are described below: "../" : Move to 阅读全文

posted @ 2021-05-21 17:12 seyjs 阅读(79) 评论(0) 推荐(0)

【leetcode】1588. Sum of All Odd Length Subarrays

摘要：题目如下： Given an array of positive integers arr, calculate the sum of all possible odd-length subarrays. A subarray is a contiguous subsequence of the a 阅读全文

posted @ 2021-05-21 16:22 seyjs 阅读(101) 评论(0) 推荐(0)

【leetcode】1559. Detect Cycles in 2D Grid

摘要：题目如下： Given a 2D array of characters grid of size m x n, you need to find if there exists any cycle consisting of the same value in grid. A cycle is a 阅读全文

posted @ 2021-05-21 16:09 seyjs 阅读(213) 评论(0) 推荐(0)

【leetcode】1583. Count Unhappy Friends

摘要：题目如下： You are given a list of preferences for n friends, where n is always even. For each person i, preferences[i] contains a list of friends sorted i 阅读全文

posted @ 2021-05-21 14:43 seyjs 阅读(107) 评论(0) 推荐(0)

【leetcode】1582. Special Positions in a Binary Matrix

摘要：题目如下： Given a rows x cols matrix mat, where mat[i][j] is either 0 or 1, return the number of special positions in mat. A position (i,j) is called spec 阅读全文

posted @ 2021-05-21 14:28 seyjs 阅读(52) 评论(0) 推荐(0)

【leetcode】1551. Minimum Operations to Make Array Equal

摘要：题目如下： You have an array arr of length n where arr[i] = (2 * i) + 1 for all valid values of i (i.e. 0 <= i < n). In one operation, you can select two i 阅读全文

posted @ 2021-05-21 14:13 seyjs 阅读(69) 评论(0) 推荐(0)

公告