seyjs - 博客园

2020年6月4日

【leetcode】1441. Build an Array With Stack Operations

摘要：题目如下： Given an array target and an integer n. In each iteration, you will read a number from list = {1,2,3..., n}. Build the target array using the fo 阅读全文

posted @ 2020-06-04 06:24 seyjs 阅读(141) 评论(0) 推荐(0)

【leetcode】1437. Check If All 1's Are at Least Length K Places Away

摘要：题目如下： Given an array nums of 0s and 1s and an integer k, return True if all 1's are at least k places away from each other, otherwise return False. Ex 阅读全文

posted @ 2020-06-04 06:18 seyjs 阅读(297) 评论(0) 推荐(0)

2020年6月3日

【leetcode】1436. Destination City

摘要：题目如下： You are given the array paths, where paths[i] = [cityAi, cityBi] means there exists a direct path going from cityAi to cityBi. Return the destin 阅读全文

posted @ 2020-06-03 22:41 seyjs 阅读(345) 评论(0) 推荐(0)

【leetcode】1433. Check If a String Can Break Another String

摘要：题目如下： Given two strings: s1 and s2 with the same size, check if some permutation of string s1 can break some permutation of string s2 or vice-versa (i 阅读全文

posted @ 2020-06-03 22:36 seyjs 阅读(379) 评论(0) 推荐(0)

【leetcode】1432. Max Difference You Can Get From Changing an Integer

摘要：题目如下： You are given an integer num. You will apply the following steps exactly two times: Pick a digit x (0 <= x <= 9). Pick another digit y (0 <= y < 阅读全文

posted @ 2020-06-03 22:32 seyjs 阅读(344) 评论(0) 推荐(0)

【leetcode】1431. Kids With the Greatest Number of Candies

摘要：题目如下： Given the array candies and the integer extraCandies, where candies[i] represents the number of candies that the ith kid has. For each kid check 阅读全文

posted @ 2020-06-03 22:22 seyjs 阅读(302) 评论(0) 推荐(0)

【leetcode】1423. Maximum Points You Can Obtain from Cards

摘要：题目如下： There are several cards arranged in a row, and each card has an associated number of points The points are given in the integer array cardPoints 阅读全文

posted @ 2020-06-03 22:14 seyjs 阅读(520) 评论(0) 推荐(0)

2020年6月1日

【leetcode】1422. Maximum Score After Splitting a String

摘要：题目如下： Given a string s of zeros and ones, return the maximum score after splitting the string into two non-empty substrings (i.e. left substring and r 阅读全文

posted @ 2020-06-01 17:55 seyjs 阅读(359) 评论(0) 推荐(0)

【leetcode】1419. Minimum Number of Frogs Croaking

摘要：题目如下： Given the string croakOfFrogs, which represents a combination of the string "croak" from different frogs, that is, multiple frogs can croak at t 阅读全文

posted @ 2020-06-01 17:48 seyjs 阅读(316) 评论(0) 推荐(0)

【leetcode】1418. Display Table of Food Orders in a Restaurant

摘要：题目如下： Given the array orders, which represents the orders that customers have done in a restaurant. More specifically orders[i]=[customerNamei,tableNu 阅读全文

posted @ 2020-06-01 06:24 seyjs 阅读(251) 评论(0) 推荐(0)

公告