xinyu04

导航

上一页 1 2 3 4 5 6 ··· 30 下一页

2023年7月14日 #

LeetCode 354. Russian Doll Envelopes 排序+LIS

摘要: You are given a 2D array of integers `envelopes` where `envelopes[i] = [wi, hi]` represents the width and the height of an envelope. One envelope can 阅读全文

posted @ 2023-07-14 22:37 Blackzxy 阅读(6) 评论(0) 推荐(0) 编辑

LeetCode 519. Random Flip Matrix 哈希Map

摘要: There is an `m x n` binary grid matrix with all the values set 0 initially. Design an algorithm to randomly pick an index `(i, j)` where `matrix[i][j] 阅读全文

posted @ 2023-07-14 20:58 Blackzxy 阅读(4) 评论(0) 推荐(0) 编辑

2023年2月13日 #

LeetCode 496. Next Greater Element I 单调栈

摘要: The next greater element of some element x in an array is the first greater element that is to the right of x in the same array. You are given two dis 阅读全文

posted @ 2023-02-13 22:39 Blackzxy 阅读(10) 评论(0) 推荐(0) 编辑

2022年11月3日 #

LeetCode 283 Move Zeroes

摘要: Given an integer array nums, move all 0's to the end of it while maintaining the relative order of the non-zero elements. Note that you must do this i 阅读全文

posted @ 2022-11-03 16:23 Blackzxy 阅读(14) 评论(0) 推荐(0) 编辑

2022年10月28日 #

[Oracle] LeetCode 1472 Design Browser History 双stack

摘要: You have a browser of one tab where you start on the homepage and you can visit another url, get back in the history number of steps or move forward i 阅读全文

posted @ 2022-10-28 15:13 Blackzxy 阅读(17) 评论(0) 推荐(0) 编辑

2022年10月27日 #

[Oracle] LeetCode 314 Binary Tree Vertical Order Traversal

摘要: Given the root of a binary tree, return the vertical order traversal of its nodes' values. (i.e., from top to bottom, column by column). If two nodes 阅读全文

posted @ 2022-10-27 02:36 Blackzxy 阅读(5) 评论(0) 推荐(0) 编辑

2022年10月26日 #

[Oracle] LeetCode 694 Number of Distinct Islands 标记路线的DFS

摘要: You are given an m x n binary matrix grid. An island is a group of 1's (representing land) connected 4-directionally (horizontal or vertical.) You may 阅读全文

posted @ 2022-10-26 06:44 Blackzxy 阅读(13) 评论(0) 推荐(0) 编辑

[Oracle] LeetCode 848 Shifting Letters

摘要: You are given a string s of lowercase English letters and an integer array shifts of the same length. Call the shift() of a letter, the next letter in 阅读全文

posted @ 2022-10-26 05:33 Blackzxy 阅读(14) 评论(0) 推荐(0) 编辑

2022年10月14日 #

[Oracle] LeetCode 300 Longest Increasing Subsequence

摘要: Given an integer array nums, return the length of the longest strictly increasing subsequence. A subsequence is a sequence that can be derived from an 阅读全文

posted @ 2022-10-14 15:18 Blackzxy 阅读(12) 评论(0) 推荐(0) 编辑

2022年10月8日 #

[Oracle] LeetCode 20 Valid Parentheses

摘要: Given a string s containing just the characters '(', ')', '{', '}', '[' and ']', determine if the input string is valid. An input string is valid if: 阅读全文

posted @ 2022-10-08 16:29 Blackzxy 阅读(9) 评论(0) 推荐(0) 编辑

上一页 1 2 3 4 5 6 ··· 30 下一页