随笔分类 -  Level 3

1 2 3 4 5 ··· 10 下一页
摘要:Given an array arr of positive integers sorted in a strictly increasing order, and an integer k. Return the kth positive integer that is missing from 阅读全文
posted @ 2025-01-09 09:39 北叶青藤 阅读(20) 评论(0) 推荐(0)
摘要:You are given a string s and an integer k. You can choose any character of the string and change it to any other uppercase English character. You can 阅读全文
posted @ 2024-12-27 02:04 北叶青藤 阅读(25) 评论(0) 推荐(0)
摘要:his is an interactive problem. You are given an array of unique strings wordlist where wordlist[i] is 6 letters long, and one word in this list is cho 阅读全文
posted @ 2021-07-06 11:37 北叶青藤 阅读(55) 评论(0) 推荐(0)
摘要:A Range Module is a module that tracks ranges of numbers. Design a data structure to track the ranges represented as half-open intervals and query abo 阅读全文
posted @ 2021-07-05 07:30 北叶青藤 阅读(59) 评论(0) 推荐(0)
摘要:Given strings s1 and s2, return the minimum contiguous substring part of s1, so that s2 is a subsequence of the part. If there is no such window in s1 阅读全文
posted @ 2021-07-05 03:31 北叶青藤 阅读(50) 评论(0) 推荐(0)
摘要:Given a rows x cols screen and a sentence represented as a list of strings, return the number of times the given sentence can be fitted on the screen. 阅读全文
posted @ 2021-07-05 01:28 北叶青藤 阅读(58) 评论(0) 推荐(0)
摘要: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 startTime,  阅读全文
posted @ 2021-06-21 08:58 北叶青藤 阅读(85) 评论(0) 推荐(0)
摘要:Alex and Lee play a game with piles of stones. There are an even number of piles arranged in a row, and each pile has a positive integer number of sto 阅读全文
posted @ 2021-04-09 23:59 北叶青藤 阅读(53) 评论(0) 推荐(0)
摘要:You are given an n x n binary matrix grid. You are allowed to change at most one 0 to be 1. Return the size of the largest island in grid after applyi 阅读全文
posted @ 2021-04-07 12:49 北叶青藤 阅读(89) 评论(0) 推荐(0)
摘要:Given a matrix of integers A with R rows and C columns, find the maximum score of a path starting at [0,0] and ending at [R-1,C-1]. The score of a pat 阅读全文
posted @ 2021-03-31 22:35 北叶青藤 阅读(73) 评论(0) 推荐(0)
摘要:Given a string S, check if the letters can be rearranged so that two characters that are adjacent to each other are not the same. If possible, output 阅读全文
posted @ 2021-03-29 06:23 北叶青藤 阅读(60) 评论(0) 推荐(0)
摘要:Given a non-negative integer, you could swap two digits at most once to get the maximum valued number. Return the maximum valued number you could get. 阅读全文
posted @ 2021-03-29 05:18 北叶青藤 阅读(39) 评论(0) 推荐(0)
摘要:Given a robot cleaner in a room modeled as a grid. Each cell in the grid can be empty or blocked. The robot cleaner with 4 given APIs can move forward 阅读全文
posted @ 2021-03-29 04:32 北叶青藤 阅读(69) 评论(0) 推荐(0)
摘要:Given a node from a Circular Linked List which is sorted in ascending order, write a function to insert a value insertVal into the list such that it r 阅读全文
posted @ 2021-03-15 11:17 北叶青藤 阅读(60) 评论(0) 推荐(0)
摘要:Given an array of integers nums and an integer target. Return the number of non-empty subsequences of nums such that the sum of the minimum and maximu 阅读全文
posted @ 2021-03-03 00:16 北叶青藤 阅读(250) 评论(0) 推荐(0)
摘要:Given the root of a Binary Search Tree and a target number k, return true if there exist two elements in the BST such that their sum is equal to the g 阅读全文
posted @ 2020-12-27 03:43 北叶青藤 阅读(91) 评论(0) 推荐(0)
摘要: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 北叶青藤 阅读(121) 评论(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 北叶青藤 阅读(216) 评论(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 北叶青藤 阅读(215) 评论(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 北叶青藤 阅读(164) 评论(0) 推荐(0)

1 2 3 4 5 ··· 10 下一页