Schwifty - 博客园

2020年6月3日

摘要： There are 2N people a company is planning to interview. The cost of flying the i-th person to city A is costs[i][0], and the cost of flying the i-th p 阅读全文

posted @ 2020-06-03 22:33 Schwifty 阅读(203) 评论(0) 推荐(0)

448. Find All Numbers Disappeared in an Array

摘要： Given an array of integers where 1 ≤ a[i] ≤ n (n = size of array), some elements appear twice and others appear once. Find all the elements of [1, n] 阅读全文

posted @ 2020-06-03 13:54 Schwifty 阅读(146) 评论(0) 推荐(0)

398. Random Pick Index

摘要： Given an array of integers with possible duplicates, randomly output the index of a given target number. You can assume that the given target number m 阅读全文

posted @ 2020-06-03 09:26 Schwifty 阅读(172) 评论(0) 推荐(0)

394. Decode String

摘要： Given an encoded string, return its decoded string. The encoding rule is: k[encoded_string], where the encoded_string inside the square brackets is be 阅读全文

posted @ 2020-06-03 06:57 Schwifty 阅读(102) 评论(0) 推荐(0)

2020年6月2日

1462. Course Schedule IV

摘要： There are a total of n courses you have to take, labeled from 0 to n-1. Some courses may have direct prerequisites, for example, to take course 0 you 阅读全文

posted @ 2020-06-02 11:00 Schwifty 阅读(194) 评论(0) 推荐(0)

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

摘要： Given a binary string s and an integer k. Return True if all binary codes of length k is a substring of s. Otherwise, return False. Example 1: Input: 阅读全文

posted @ 2020-06-02 09:45 Schwifty 阅读(264) 评论(0) 推荐(0)

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 allowed to 阅读全文

posted @ 2020-06-02 08:47 Schwifty 阅读(340) 评论(0) 推荐(0)

2020年6月1日

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 form a tr 阅读全文

posted @ 2020-06-01 09:45 Schwifty 阅读(337) 评论(0) 推荐(0)

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]-1). Ex 阅读全文

posted @ 2020-06-01 09:16 Schwifty 阅读(192) 评论(0) 推荐(0)

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 distance 阅读全文

posted @ 2020-06-01 09:15 Schwifty 阅读(318) 评论(0) 推荐(0)

热带雨林

公告