seyjs - 博客园

2020年4月4日

摘要：题目如下： There are n soldiers standing in a line. Each soldier is assigned a unique rating value. You have to form a team of 3 soldiers amongst them unde 阅读全文

posted @ 2020-04-04 13:41 seyjs 阅读(336) 评论(0) 推荐(0)

【leetcode】1394. Find Lucky Integer in an Array

摘要：题目如下： Given an array of integers arr, a lucky integer is an integer which has a frequency in the array equal to its value. Return a lucky integer in t 阅读全文

posted @ 2020-04-04 13:30 seyjs 阅读(374) 评论(0) 推荐(0)

2020年3月29日

【leetcode】1391. Check if There is a Valid Path in a Grid

摘要：题目如下： Given a m x n grid. Each cell of the grid represents a street. The street of grid[i][j] can be: 1 which means a street connecting the left cell 阅读全文

posted @ 2020-03-29 07:23 seyjs 阅读(490) 评论(0) 推荐(0)

【leetcode】1390. Four Divisors

摘要：题目如下： Given an integer array nums, return the sum of divisors of the integers in that array that have exactly four divisors. If there is no such integ 阅读全文

posted @ 2020-03-29 07:17 seyjs 阅读(291) 评论(0) 推荐(0)

【leetcode】1389. Create Target Array in the Given Order

摘要：题目如下： Given two arrays of integers nums and index. Your task is to create target array under the following rules: Initially target array is empty. Fro 阅读全文

posted @ 2020-03-29 07:16 seyjs 阅读(382) 评论(0) 推荐(0)

【leetcode】1387. Sort Integers by The Power Value

摘要：题目如下： The power of an integer x is defined as the number of steps needed to transform x into 1 using the following steps: if x is even then x = x / 2 阅读全文

posted @ 2020-03-29 07:09 seyjs 阅读(633) 评论(0) 推荐(0)

【leetcode】1386. Cinema Seat Allocation

摘要：题目如下： A cinema has n rows of seats, numbered from 1 to n and there are ten seats in each row, labelled from 1 to 10 as shown in the figure above. Give 阅读全文

posted @ 2020-03-29 07:05 seyjs 阅读(413) 评论(0) 推荐(0)

【leetcode】1385. Find the Distance Value Between Two Arrays

摘要：题目如下： Given two integer arrays arr1 and arr2, and the integer d, return the distance value between the two arrays. The distance value is defined as th 阅读全文

posted @ 2020-03-29 07:01 seyjs 阅读(268) 评论(0) 推荐(0)

【leetcode】1383. Maximum Performance of a Team

摘要：题目如下： There are n engineers numbered from 1 to n and two arrays: speed and efficiency, where speed[i] and efficiency[i] represent the speed and effici 阅读全文

posted @ 2020-03-29 06:59 seyjs 阅读(400) 评论(0) 推荐(0)

2020年3月21日

【leetcode】1381. Design a Stack With Increment Operation

摘要：题目如下： Design a stack which supports the following operations. Implement the CustomStack class: CustomStack(int maxSize) Initializes the object with ma 阅读全文

posted @ 2020-03-21 22:09 seyjs 阅读(367) 评论(0) 推荐(0)

公告