03 2022 档案

摘要:题目 You are a professional robber planning to rob houses along a street. Each house has a certain amount of money stashed. All houses at this place are 阅读全文
posted @ 2022-03-31 20:15 frankming 阅读(21) 评论(0) 推荐(0) 编辑
摘要:题目 Given an m x n grid of characters board and a string word, return true if word exists in the grid. The word can be constructed from letters of sequ 阅读全文
posted @ 2022-03-31 17:34 frankming 阅读(48) 评论(0) 推荐(0) 编辑
摘要:题目 Given n pairs of parentheses, write a function to generate all combinations of well-formed parentheses. Example 1: Input: n = 3 Output: ["((()))"," 阅读全文
posted @ 2022-03-30 17:24 frankming 阅读(20) 评论(0) 推荐(0) 编辑
摘要:题目 Given a collection of candidate numbers (candidates) and a target number (target), find all unique combinations in candidates where the candidate n 阅读全文
posted @ 2022-03-30 15:14 frankming 阅读(28) 评论(0) 推荐(0) 编辑
摘要:题目 Given a string containing digits from 2-9 inclusive, return all possible letter combinations that the number could represent. Return the answer in 阅读全文
posted @ 2022-03-29 18:57 frankming 阅读(18) 评论(0) 推荐(0) 编辑
摘要:题目 Given an array of distinct integers candidates and a target integer target, return a list of all unique combinations of candidates where the chosen 阅读全文
posted @ 2022-03-29 10:38 frankming 阅读(23) 评论(0) 推荐(0) 编辑
摘要:题目 Given a collection of numbers, nums, that might contain duplicates, return all possible unique permutations in any order. Example 1: Input: nums = 阅读全文
posted @ 2022-03-28 20:13 frankming 阅读(18) 评论(0) 推荐(0) 编辑
摘要:题目 Given an integer array nums that may contain duplicates, return all possible subsets (the power set). The solution set must not contain duplicate s 阅读全文
posted @ 2022-03-28 16:36 frankming 阅读(20) 评论(0) 推荐(0) 编辑
摘要:题目 Given an integer array nums of unique elements, return all possible subsets (the power set). The solution set must not contain duplicate subsets. R 阅读全文
posted @ 2022-03-28 14:43 frankming 阅读(18) 评论(0) 推荐(0) 编辑
摘要:题目 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 o 阅读全文
posted @ 2022-03-28 14:12 frankming 阅读(25) 评论(0) 推荐(0) 编辑
摘要:题目 Given an m x n matrix board containing 'X' and 'O', capture all regions that are 4-directionally surrounded by 'X'. A region is captured by flippin 阅读全文
posted @ 2022-03-28 13:52 frankming 阅读(21) 评论(0) 推荐(0) 编辑
摘要:题目 Given an n x n binary matrix grid, return the length of the shortest clear path in the matrix. If there is no clear path, return -1. A clear path i 阅读全文
posted @ 2022-03-24 23:55 frankming 阅读(43) 评论(0) 推荐(0) 编辑
摘要:题目 Given the roots of two binary trees root and subRoot, return true if there is a subtree of root with the same structure and node values of subRoot 阅读全文
posted @ 2022-03-24 23:07 frankming 阅读(16) 评论(0) 推荐(0) 编辑
摘要:题目 Given a binary tree struct Node { int val; Node *left; Node *right; Node *next; } Populate each next pointer to point to its next right node. If th 阅读全文
posted @ 2022-03-21 23:57 frankming 阅读(19) 评论(0) 推荐(0) 编辑
摘要:题目 There are n cities. Some of them are connected, while some are not. If city a is connected directly with city b, and city b is connected directly w 阅读全文
posted @ 2022-03-20 23:59 frankming 阅读(81) 评论(0) 推荐(0) 编辑
摘要:题目 Given an m x n 2D binary grid grid which represents a map of '1's (land) and '0's (water), return the number of islands. An island is surrounded by 阅读全文
posted @ 2022-03-20 23:17 frankming 阅读(25) 评论(0) 推荐(0) 编辑
摘要:题目 Given an array of positive integers nums and a positive integer target, return the minimal length of a contiguous subarray [numsl, numsl+1, ..., nu 阅读全文
posted @ 2022-03-20 22:59 frankming 阅读(21) 评论(0) 推荐(0) 编辑
摘要:题目 Given an array of integers nums and an integer k, return the number of contiguous subarrays where the product of all the elements in the subarray i 阅读全文
posted @ 2022-03-18 11:17 frankming 阅读(29) 评论(0) 推荐(0) 编辑
摘要:题目 Given two strings s and p, return an array of all the start indices of p's anagrams in s. You may return the answer in any order. An Anagram is a w 阅读全文
posted @ 2022-03-17 17:10 frankming 阅读(32) 评论(0) 推荐(0) 编辑
摘要:题目 You are given an integer array height of length n. There are n vertical lines drawn such that the two endpoints of the ith line are (i, 0) and (i, 阅读全文
posted @ 2022-03-17 16:30 frankming 阅读(19) 评论(0) 推荐(0) 编辑
摘要:题目 You are given two lists of closed intervals, firstList and secondList, where firstList[i] = [starti, endi] and secondList[j] = [startj, endj]. Each 阅读全文
posted @ 2022-03-17 00:26 frankming 阅读(22) 评论(0) 推荐(0) 编辑
摘要:题目 Given two strings s and t, return true if they are equal when both are typed into empty text editors. '#' means a backspace character. Note that af 阅读全文
posted @ 2022-03-15 23:59 frankming 阅读(29) 评论(0) 推荐(0) 编辑
摘要:题目 Given an integer array nums, return all the triplets [nums[i], nums[j], nums[k]] such that i != j, i != k, and j != k, and nums[i] + nums[j] + nums 阅读全文
posted @ 2022-03-15 15:15 frankming 阅读(35) 评论(0) 推荐(0) 编辑
摘要:题目 Given the head of a sorted linked list, delete all nodes that have duplicate numbers, leaving only distinct numbers from the original list. Return 阅读全文
posted @ 2022-03-15 14:40 frankming 阅读(24) 评论(0) 推荐(0) 编辑
摘要:题目 A peak element is an element that is strictly greater than its neighbors. Given an integer array nums, find a peak element, and return its index. I 阅读全文
posted @ 2022-03-13 23:47 frankming 阅读(19) 评论(0) 推荐(0) 编辑
摘要:题目 Suppose an array of length n sorted in ascending order is rotated between 1 and n times. For example, the array nums = [0,1,2,4,5,6,7] might become 阅读全文
posted @ 2022-03-13 23:25 frankming 阅读(20) 评论(0) 推荐(0) 编辑
摘要:题目 Write an efficient algorithm that searches for a value target in an m x n integer matrix matrix. This matrix has the following properties: Integers 阅读全文
posted @ 2022-03-11 15:01 frankming 阅读(21) 评论(0) 推荐(0) 编辑
摘要:题目 There is an integer array nums sorted in ascending order (with distinct values). Prior to being passed to your function, nums is possibly rotated a 阅读全文
posted @ 2022-03-11 14:31 frankming 阅读(20) 评论(0) 推荐(0) 编辑
摘要:题目 Given an array of integers nums sorted in non-decreasing order, find the starting and ending position of a given target value. If target is not fou 阅读全文
posted @ 2022-03-11 14:16 frankming 阅读(25) 评论(0) 推荐(0) 编辑
摘要:题目 Given a non-empty array of integers nums, every element appears twice except for one. Find that single one. You must implement a solution with a li 阅读全文
posted @ 2022-03-11 00:02 frankming 阅读(19) 评论(0) 推荐(0) 编辑
摘要:题目 Reverse bits of a given 32 bits unsigned integer. Note: Note that in some languages, such as Java, there is no unsigned integer type. In this case, 阅读全文
posted @ 2022-03-10 23:48 frankming 阅读(19) 评论(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 so 阅读全文
posted @ 2022-03-10 16:23 frankming 阅读(19) 评论(0) 推荐(0) 编辑
摘要:题目 Given an integer n, return true if it is a power of two. Otherwise, return false. An integer n is a power of two, if there exists an integer x such 阅读全文
posted @ 2022-03-10 15:45 frankming 阅读(23) 评论(0) 推荐(0) 编辑
摘要:题目 Given a triangle array, return the minimum path sum from top to bottom. For each step, you may move to an adjacent number of the row below. More fo 阅读全文
posted @ 2022-03-10 00:20 frankming 阅读(26) 评论(0) 推荐(0) 编辑
摘要:题目 You are a professional robber planning to rob houses along a street. Each house has a certain amount of money stashed, the only constraint stopping 阅读全文
posted @ 2022-03-09 19:45 frankming 阅读(20) 评论(0) 推荐(0) 编辑
摘要:题目 You are climbing a staircase. It takes n steps to reach the top. Each time you can either climb 1 or 2 steps. In how many distinct ways can you cli 阅读全文
posted @ 2022-03-09 19:32 frankming 阅读(22) 评论(0) 推荐(0) 编辑
摘要:题目 Given a string s, you can transform every letter individually to be lowercase or uppercase to create another string. Return a list of all possible 阅读全文
posted @ 2022-03-09 19:26 frankming 阅读(24) 评论(0) 推荐(0) 编辑
摘要:题目 Given an array nums of distinct integers, return all the possible permutations. You can return the answer in any order. Example 1: Input: nums = [1 阅读全文
posted @ 2022-03-09 19:09 frankming 阅读(21) 评论(0) 推荐(0) 编辑
摘要:题目 Given two integers n and k, return all possible combinations of k numbers out of the range [1, n]. You may return the answer in any order. Example 阅读全文
posted @ 2022-03-08 15:14 frankming 阅读(19) 评论(0) 推荐(0) 编辑
摘要:题目 Given the head of a singly linked list, reverse the list, and return the reversed list. Example 1: Input: head = [1,2,3,4,5] Output: [5,4,3,2,1] Ex 阅读全文
posted @ 2022-03-08 14:26 frankming 阅读(33) 评论(0) 推荐(0) 编辑
摘要:题目 You are given a perfect binary tree where all leaves are on the same level, and every parent has two children. The binary tree has the following de 阅读全文
posted @ 2022-03-08 14:05 frankming 阅读(25) 评论(0) 推荐(0) 编辑
摘要:## 简介 ansible回调插件(callback plugins)允许为事件添加一些额外响应。这里的事件包括了执行任务(task)的结果,例如(ok、failed、unreachable、skipped),以及执行剧本(playbook)的过程(start、hosts_matched、task_ 阅读全文
posted @ 2022-03-07 17:44 frankming 阅读(1766) 评论(0) 推荐(0) 编辑
摘要:题目 You are given the heads of two sorted linked lists list1 and list2. Merge the two lists in a one sorted list. The list should be made by splicing t 阅读全文
posted @ 2022-03-03 23:58 frankming 阅读(41) 评论(0) 推荐(0) 编辑
摘要:题目 You are given an m x n grid where each cell can have one of three values: 0 representing an empty cell, 1 representing a fresh orange, or 2 represe 阅读全文
posted @ 2022-03-03 16:15 frankming 阅读(29) 评论(0) 推荐(0) 编辑
摘要:题目 Given an m x n binary matrix mat, return the distance of the nearest 0 for each cell. The distance between two adjacent cells is 1. Example 1: Inpu 阅读全文
posted @ 2022-03-03 00:16 frankming 阅读(17) 评论(0) 推荐(0) 编辑
摘要:题目 You are given two binary trees root1 and root2. Imagine that when you put one of them to cover the other, some nodes of the two trees are overlappe 阅读全文
posted @ 2022-03-01 23:56 frankming 阅读(22) 评论(0) 推荐(0) 编辑
摘要:题目 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 阅读全文
posted @ 2022-03-01 23:18 frankming 阅读(23) 评论(0) 推荐(0) 编辑

点击右上角即可分享
微信分享提示