seyjs - 博客园

2019年10月24日

【leetcode】1235. Maximum Profit in Job Scheduling

摘要：题目如下： We have n jobs, where every job is scheduled to be done from startTime[i] to endTime[i], obtaining a profit of profit[i]. You're given the start 阅读全文

posted @ 2019-10-24 10:39 seyjs 阅读(573) 评论(0) 推荐(0)

【leetcode】1234. Replace the Substring for Balanced String

摘要：题目如下： You are given a string containing only 4 kinds of characters 'Q', 'W', 'E' and 'R'. A string is said to be balanced if each of its characters ap 阅读全文

posted @ 2019-10-24 10:22 seyjs 阅读(441) 评论(0) 推荐(0)

2019年10月21日

【leetcode】1233. Remove Sub-Folders from the Filesystem

摘要：题目如下： Given a list of folders, remove all sub-folders in those folders and return in any order the folders after removing. If a folder[i] is located w 阅读全文

posted @ 2019-10-21 15:02 seyjs 阅读(540) 评论(0) 推荐(0)

【leetcode】1232. Check If It Is a Straight Line

摘要：题目如下： You are given an array coordinates, coordinates[i] = [x, y], where [x, y] represents the coordinate of a point. Check if these points make a str 阅读全文

posted @ 2019-10-21 14:58 seyjs 阅读(598) 评论(0) 推荐(0)

【leetcode】1230.Toss Strange Coins

摘要：题目如下： You have some coins. The i-th coin has a probability prob[i] of facing heads when tossed. Return the probability that the number of coins facing 阅读全文

posted @ 2019-10-21 14:53 seyjs 阅读(706) 评论(2) 推荐(1)

【leetcode】1229.Meeting Scheduler

摘要：题目如下：你是一名行政助理，手里有两位客户的空闲时间表：slots1 和 slots2，以及会议的预计持续时间 duration，请你为他们安排合适的会议时间。「会议时间」是两位客户都有空参加，并且持续时间能够满足预计时间 duration 的最早的时间间隔。如果没有满足要求的会议时间，就请阅读全文

posted @ 2019-10-21 14:46 seyjs 阅读(980) 评论(0) 推荐(1)

【leetcode】1228.Missing Number In Arithmetic Progression

摘要：题目如下：解题思路：题目很简单。先对数组排序，根据最大值和最小值即可求出公差，然后遍历数组，计算相邻元素的差，如果差不等于公差，即表示数字缺失。代码如下：阅读全文

posted @ 2019-10-21 14:41 seyjs 阅读(438) 评论(0) 推荐(1)

2019年10月18日

【leetcode】1227. Airplane Seat Assignment Probability

摘要：题目如下： n passengers board an airplane with exactly n seats. The first passenger has lost the ticket and picks a seat randomly. But after that, the rest 阅读全文

posted @ 2019-10-18 15:08 seyjs 阅读(599) 评论(0) 推荐(1)

2019年10月16日

【leetcode】1224. Maximum Equal Frequency

摘要：题目如下： Given an array nums of positive integers, return the longest possible length of an array prefix of nums, such that it is possible to remove exac 阅读全文

posted @ 2019-10-16 10:56 seyjs 阅读(461) 评论(0) 推荐(0)

【leetcode】1222. Queens That Can Attack the King

摘要：题目如下： On an 8x8 chessboard, there can be multiple Black Queens and one White King. Given an array of integer coordinates queens that represents the po 阅读全文

posted @ 2019-10-16 10:41 seyjs 阅读(414) 评论(0) 推荐(0)

公告