上一页 1 ··· 4 5 6 7 8 9 10 11 12 ··· 53 下一页
摘要: 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 北叶青藤 阅读(113) 评论(0) 推荐(0) 编辑
摘要: 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 北叶青藤 阅读(95) 评论(0) 推荐(0) 编辑
摘要: 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) 编辑
摘要: 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 北叶青藤 阅读(164) 评论(0) 推荐(0) 编辑
摘要: 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 北叶青藤 阅读(72) 评论(0) 推荐(0) 编辑
摘要: 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 北叶青藤 阅读(68) 评论(0) 推荐(0) 编辑
摘要: 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) 编辑
摘要: In an N by N square grid, each cell is either empty (0) or blocked (1). A clear path from top-left to bottom-right has length k if and only if it is c 阅读全文
posted @ 2020-09-22 02:29 北叶青藤 阅读(205) 评论(0) 推荐(0) 编辑
摘要: Given the root of a binary tree, find the maximum value V for which there exists different nodes A and B where V = |A.val - B.val| and A is an ancesto 阅读全文
posted @ 2020-04-05 10:46 北叶青藤 阅读(262) 评论(0) 推荐(0) 编辑
摘要: In a given array nums of positive integers, find three non-overlapping subarrays with maximum sum. Each subarray will be of size k, and we want to max 阅读全文
posted @ 2020-03-15 09:45 北叶青藤 阅读(159) 评论(0) 推荐(0) 编辑
上一页 1 ··· 4 5 6 7 8 9 10 11 12 ··· 53 下一页