随笔列表第8页 - 北叶青藤

2020年12月27日

摘要： Given a directed acyclic graph (DAG) of n nodes labeled from 0 to n - 1, find all possible paths from node 0 to node n - 1, and return them in any ord 阅读全文

posted @ 2020-12-27 02:45 北叶青藤阅读(97) 评论(0) 推荐(0)

1053. Previous Permutation With One Swap

摘要： Given an array of positive integers arr (not necessarily distinct), return the lexicographically largest permutation that is smaller than arr, that ca 阅读全文

posted @ 2020-12-27 01:47 北叶青藤阅读(122) 评论(0) 推荐(0)

1257. Smallest Common Region

摘要： You are given some lists of regions where the first region of each list includes all other regions in that list. Naturally, if a region X contains ano 阅读全文

posted @ 2020-12-27 00:54 北叶青藤阅读(111) 评论(0) 推荐(0)

2020年12月16日

844. Backspace String Compare

摘要： Given two strings S and T, return if they are equal when both are typed into empty text editors. # means a backspace character. Example 1: Input: S = 阅读全文

posted @ 2020-12-16 07:55 北叶青藤阅读(117) 评论(0) 推荐(0)

703. Kth Largest Element in a Stream

摘要： Problem description: Design a class to find the kth largest element in a stream. Note that it is the kth largest element in the sorted order, not the 阅读全文

posted @ 2020-12-16 07:47 北叶青藤阅读(98) 评论(0) 推荐(0)

2020年12月14日

721. Accounts Merge

摘要： Given a list accounts, each element accounts[i] is a list of strings, where the first element accounts[i][0] is a name, and the rest of the elements a 阅读全文

posted @ 2020-12-14 14:05 北叶青藤阅读(116) 评论(0) 推荐(0)

1197. Minimum Knight Moves

摘要： In an infinite chess board with coordinates from -infinity to +infinity, you have a knight at square [0, 0].A knight has 8 possible moves it can make, 阅读全文

posted @ 2020-12-14 13:57 北叶青藤阅读(192) 评论(0) 推荐(0)

2020年12月6日

1356. Sort Integers by The Number of 1 Bits

摘要： Given an integer array arr. You have to sort the integers in the array in ascending order by the number of 1's in their binary representation and in c 阅读全文

posted @ 2020-12-06 05:34 北叶青藤阅读(77) 评论(0) 推荐(0)

2020年12月2日

525. Contiguous Array

摘要： Given a binary array, find the maximum length of a contiguous subarray with equal number of 0 and 1. Example 1: Input: [0,1] Output: 2 Explanation: [0 阅读全文

posted @ 2020-12-02 14:10 北叶青藤阅读(72) 评论(0) 推荐(0)

2020年12月1日

191. Number of 1 Bits

摘要： Write a function that takes an unsigned integer and returns the number of '1' bits it has (also known as the Hamming weight). Note: Note that in some 阅读全文

posted @ 2020-12-01 12:30 北叶青藤阅读(96) 评论(0) 推荐(0)

北叶青藤

公告