qq_41878358的博客

LeetCode 841. Keys and Rooms 钥匙和房间（Java）

题目：A linked list is given such that each node contains an additional random pointer which could point to any node in the list or null.Return a deep copy of the list.The Linked List is represented in the input/output as a list of n nodes. Each node is re

题目：Given a non-empty array of integers, every element appears three times except for one, which appears exactly once. Find that single one.Note:Your algorithm should have a linear runtime complexity. Could you implement it without using extra memory?E

题目：There are N gas stations along a circular route, where the amount of gas at station i is gas[i].You have a car with an unlimited gas tank and it costs cost[i] of gas to travel from station i to its next station (i+1). You begin the journey with an emp

题目：Given a reference of a node in a connected undirected graph.Return a deep copy (clone) of the graph.Each node in the graph contains a val (int) and a list (List[Node]) of its neighbors.class No...

题目：Given a string s, partition s such that every substring of the partition is a palindrome.Return all possible palindrome partitioning of s.Example:Input: “aab”Output:[[“aa”,“b”],[“a”,“a”,“b...

题目：Given a 2D board containing ‘X’ and ‘O’ (the letter O), capture all regions surrounded by ‘X’.A region is captured by flipping all 'O’s into 'X’s in that surrounded region.Example:X X X XX O ...

题目：Given a binary tree containing digits from 0-9 only, each root-to-leaf path could represent a number.An example is the root-to-leaf path 1->2->3 which represents the number 123.Find the to...

题目：Given two words (beginWord and endWord), and a dictionary’s word list, find the length of shortest transformation sequence from beginWord to endWord, such that:Only one letter can be changed at ...

题目：Given a triangle, find the minimum path sum from top to bottom. Each step you may move to adjacent numbers on the row below.For example, given the following triangle[ [2], [3,4], [6,...

题目：Given a binary treestruct Node { int val; Node *left; Node *right; Node *next;}Populate each next pointer to point to its next right node. If there is no next right node, the next poin...

题目：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 definition:struct Node { int val; Node *left;...

题目：Given a binary tree, flatten it to a linked list in-place.解答：本题主要是怎样在原地 将二叉树转换为链表我采用的思路如下：判断 root.left 是否为空，若不为空，则找到 temp 节点为左子树的最右节点将 root 的右子树连接到左子树的最右节点 temp将左子树连接为 root 的右子树，并将 root 左子...

题目：Given a binary tree and a sum, find all root-to-leaf paths where each path’s sum equals the given sum.Note: A leaf is a node with no children.解答：本题为 LeetCode 112 题的进阶版。通过 DFS 深度优先搜索，找到满足的路径。在这...

题目：Given a singly linked list where elements are sorted in ascending order, convert it to a height balanced BST.For this problem, a height-balanced binary tree is defined as a binary tree in which t...

题目：Given inorder and postorder traversal of a tree, construct the binary tree.Note: You may assume that duplicates do not exist in the tree.解答：本题根据树的中序遍历和后序遍历，得到树的结构。与 LeetCode 105 思路基本一致整体思路为：...

题目：Given preorder and inorder traversal of a tree, construct the binary tree.Note: You may assume that duplicates do not exist in the tree.解答：题目根据树的前序遍历和中序遍历，得到树的结构整体思路为：首先我们知道，前序遍历的第一个节点一定是根节点...

题目：Given a binary tree, return the zigzag level order traversal of its nodes’ values. (ie, from left to right, then right to left for the next level and alternate between).解答：解法一：堆栈与 LeetCode 102...

题目：Given a binary tree, return the level order traversal of its nodes’ values. (ie, from left to right, level by level).解答：解法一：这道题为二叉树的层级遍历借助ArrayList，实现了层级遍历，具体思路为：创建 list，用于存储当前遍历层的节点创建 nex...

题目：Given n, how many structurally unique BST’s (binary search trees) that store values 1 … n?解答：这道题与 LeetCode 95 题基本一致，但解法不相同。也是采用动态规划的思想，二叉搜索树的个数 = 左子树的个数 * 右子树的个数因此把问题换分为两个子问题，及求解当前根节点情况下，左子树与...

题目：Given an integer n, generate all structurally unique BST’s (binary search trees) that store values 1 … n.解答：本题没有想到解题思路，所以采用了官方给的解法，通过递归实现，值得好好学习。首先二叉搜索树的特点是：左子树 < 根节点 < 右子树所以要找到 1-n 所有的...

题目：Given a binary tree, return the inorder traversal of its nodes’ values.Follow up: Recursive solution is trivial, could you do it iteratively?解答：二叉树的中序遍历，很基础的题目，递归方法比较简单，题目要求我们尝试用非递归的方式求解，则借助栈 ...

题目：Given a string containing only digits, restore it by returning all possible valid IP address combinations.Example:Input: “25525511135”Output: [“255.255.11.135”, “255.255.111.35”]解答：这类问题基本采用...

题目：Reverse a linked list from position m to n. Do it in one-pass.Note: 1 ≤ m ≤ n ≤ length of list.Example:Input: 1->2->3->4->5->NULL, m = 2, n = 4Output: 1->4->3->2->5...

题目：A message containing letters from A-Z is being encoded to numbers using the following mapping:‘A’ -> 1‘B’ -> 2…‘Z’ -> 26Given a non-empty string containing only digits, determine t...

题目：Given a collection of integers that might contain duplicates, nums, return all possible subsets (the power set).Note: The solution set must not contain duplicate subsets.Example:Input: [1,2,2]...

题目：Given a linked list and a value x, partition it such that all nodes less than x come before nodes greater than or equal to x.You should preserve the original relative order of the nodes in each o...

题目：Given a sorted linked list, delete all nodes that have duplicate numbers, leaving only distinct numbers from the original list.Return the linked list sorted as well.Example 1:Input: 1->2-&g...

题目：Suppose an array sorted in ascending order is rotated at some pivot unknown to you beforehand.(i.e., [0,0,1,2,2,5,6] might become [2,5,6,0,0,1,2]).You are given a target value to search. If foun...

题目:Given a sorted array nums, remove the duplicates in-place such that duplicates appeared at most twice and return the new length.Do not allocate extra space for another array, you must do this by ...

题目：Given a 2D board and a word, find if the word exists in the grid.The word can be constructed from letters of sequentially adjacent cell, where “adjacent” cells are those horizontally or verticall...

题目：Given a set of distinct integers, nums, return all possible subsets (the power set).Note: The solution set must not contain duplicate subsets.Example:Input: nums = [1,2,3]Output:[[3],[1],...

题目：Given two integers n and k, return all possible combinations of k numbers out of 1 … n.Example:Input: n = 4, k = 2Output:[[2,4],[3,4],[2,3],[1,2],[1,3],[1,4],]解答：解法一：回溯法这是一道明显回溯的题目...

题目：Given an array with n objects colored red, white or blue, sort them in-place so that objects of the same color are adjacent, with the colors in the order red, white and blue.Here, we will use the...

题目：Write an efficient algorithm that searches for a value in an m x n matrix. This matrix has the following properties:Integers in each row are sorted from left to right.The first integer of each ...

题目：Given a m x n matrix, if an element is 0, set its entire row and column to 0. Do it in-place.Example 1:Input:[[1,1,1],[1,0,1],[1,1,1]]Output:[[1,0,1],[0,0,0],[1,0,1]]Example 2:In...

题目：Given a m x n grid filled with non-negative numbers, find a path from top left to bottom right which minimizes the sum of all numbers along its path.Note: You can only move either down or right a...

题目一：A robot is located at the top-left corner of a m x n grid (marked ‘Start’ in the diagram below).The robot can only move either down or right at any point in time. The robot is trying to reach th...

题目：Given a linked list, rotate the list to the right by k places, where k is non-negative.Example 1:Input: 1->2->3->4->5->NULL, k = 2Output: 4->5->1->2->3->NULLExpl...

题目：The set [1,2,3,…,n] contains a total of n! unique permutations.By listing and labeling all of the permutations in order, we get the following sequence for n = 3:“123”“132”“213”“231”“312”“3...