LeetCode
turbo624
这个作者很懒,什么都没留下…
展开
-
【leetcode】-231. Power of Two 2的指数
Power of Two题目位运算Java题目Given an integer, write a function to determine if it is a power of two.Example 1:Input: 1Output: trueExplanation: 20 = 1Example 2:Input: 16Output: trueExplanation: 24 = 16Example 3:Input: 218Output: false位运算【leetcode】原创 2020-07-28 15:59:33 · 318 阅读 · 0 评论 -
【leetcode】-191. Number of 1 Bits 数字二进制表示1的个数
Number of 1 Bits题目n&(n-1)Java题目Write a function that takes an unsigned integer and return the number of ‘1’ bits it has (also known as the Hamming weight).Example 1:Input: 00000000000000000000000000001011Output: 3Explanation: The input binary str原创 2020-07-28 15:50:13 · 345 阅读 · 0 评论 -
【leetcode】-1. Two Sum 两数和
Two Sum题目哈希表题目Given an array of integers, return indices of the two numbers such that they add up to a specific target.You may assume that each input would have exactly one solution, and you may not use the same element twice.Example:Given nums = [2,原创 2020-07-28 15:34:31 · 243 阅读 · 0 评论 -
【leetcode】-22. Generate Parentheses生成括号
Generate Parentheses题目回溯+剪枝python代码题目Given n pairs of parentheses, write a function to generate all combinations of well-formed parentheses.For example, given n = 3, a solution set is:[“((()))”,“(()())”,“(())()”,“()(())”,“()()()”]输入一个数字n,看有多少种匹配原创 2020-07-27 11:18:44 · 210 阅读 · 0 评论 -
【leetcode】-37. Sudoku Solver 解数独
Sudoku Solver题目回溯Java代码题目Write a program to solve a Sudoku puzzle by filling the empty cells.A sudoku solution must satisfy all of the following rules:Each of the digits 1-9 must occur exactly once in each row.Each of the digits 1-9 must occur exactly原创 2020-07-26 23:56:25 · 208 阅读 · 0 评论 -
【leetcode】-225. Implement Stack using Queues 用队列实现栈
Implement Stack using Queues题目队列实现栈Java代码python代码题目Implement the following operations of a stack using queues.push(x) – Push element x onto stack.pop() – Removes the element on top of the stack.top() – Get the top element.empty() – Return whether the原创 2020-07-24 23:07:24 · 150 阅读 · 0 评论 -
【leetcode】-232. Implement Queue using Stacks 用栈实现队列
Implement Queue using Stacks题目两栈底重合组成队列Java代码python 代码题目Implement the following operations of a queue using stacks.push(x) – Push element x to the back of queue.pop() – Removes the element from in front of queue.peek() – Get the front element.empty()原创 2020-07-24 21:46:48 · 193 阅读 · 0 评论 -
【leetcode】-92. Reverse Linked List II 反转部分链表II python版
反转部分链表题目递归法python 代码题目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->NULL递归法1、首先递归写出反转全部链表;2、然后在1基原创 2020-07-24 00:41:01 · 131 阅读 · 0 评论 -
【leetcode】- 239. Sliding Window Maximum滑动窗口最大值 python版
滑动窗口最大值题目单调队列python代码题目Given an array nums, there is a sliding window of size k which is moving from the very left of the array to the very right. You can only see the k numbers in the window. Each time the sliding window moves right by one position. Ret原创 2020-07-24 00:07:27 · 228 阅读 · 0 评论 -
【leetcode】-503. Next Greater Element II下一个较大的数II
Next Greater Element II题目单调栈python代码题目Given a circular array (the next element of the last element is the first element of the array), print the Next Greater Number for every element. The Next Greater Number of a number x is the first greater number to i原创 2020-07-07 21:46:46 · 224 阅读 · 0 评论 -
【leetcode】-496. Next Greater Element I 下一个更大元素I
Next Greater Element I题目暴力法python 代码栈python 代码题目You are given two arrays (without duplicates) nums1 and nums2 where nums1’s elements are subset of nums2. Find all the next greater numbers for nums1’s elements in the corresponding places of nums2.The Nex原创 2020-07-07 21:22:20 · 270 阅读 · 0 评论 -
【leetcode】-222. Count Complete Tree Nodes计算完全二叉树结点数
Count Complete Tree Nodes题目树的递归python 代码完全二叉树递归python 代码题目Given a complete binary tree, count the number of nodes.Note:Definition of a complete binary tree from Wikipedia:In a complete binary tree every level, except possibly the last, is completely f原创 2020-07-06 22:21:13 · 254 阅读 · 0 评论 -
【leetcode】-450. Delete Node in a BST删除BST中一个结点
Delete Node in a BST题目递归python 代码题目Given a root node reference of a BST and a key, delete the node with the given key in the BST. Return the root node reference (possibly updated) of the BST.Basically, the deletion can be divided into two stages:Search原创 2020-07-06 16:56:10 · 197 阅读 · 0 评论 -
【leetcode】-701. Insert into a Binary Search Tree插入数据到二叉搜索树中
Insert into a Binary Search Tree题目递归python 代码题目Given the root node of a binary search tree (BST) and a value to be inserted into the tree, insert the value into the BST. Return the root node of the BST after the insertion. It is guaranteed that the new v原创 2020-07-06 16:25:53 · 208 阅读 · 0 评论 -
【leetcode】-700. Search in a Binary Search Tree 查找二叉搜索树
Search in a Binary Search Tree题目递归python 代码题目Given the root node of a binary search tree (BST) and a value. You need to find the node in the BST that the node’s value equals the given value. Return the subtree rooted with that node. If such node doesn’t原创 2020-07-06 16:14:43 · 618 阅读 · 0 评论 -
【leetcode】-98. Validate Binary Search Tree有效的二叉搜索树
Validate Binary Search Tree题目递归python 代码题目Given a binary tree, determine if it is a valid binary search tree (BST).Assume a BST is defined as follows:The left subtree of a node contains only nodes with keys less than the node’s key.The right subtree o原创 2020-07-06 16:01:08 · 174 阅读 · 0 评论 -
【leetcode】-100. Same Tree判断相同树
Same Tree题目递归python 代码题目Given two binary trees, write a function to check if they are the same or not.Two binary trees are considered the same if they are structurally identical and the nodes have the same value.Example 1:Input: 1 1原创 2020-07-06 15:43:33 · 212 阅读 · 0 评论 -
【leetcode】-25. Reverse Nodes in k-Group 反转k组数组
Reverse Nodes in k-Group题目递归python 代码题目Given a linked list, reverse the nodes of a linked list k at a time and return its modified list.k is a positive integer and is less than or equal to the length of the linked list. If the number of nodes is not a m原创 2020-07-06 14:55:57 · 251 阅读 · 0 评论 -
【leetcode】-5. Longest Palindromic Substring求最长回文子串
Longest Palindromic Substring题目动态规划python代码题目Given a string s, find the longest palindromic substring in s. You may assume that the maximum length of s is 1000.Example 1:Input: “babad”Output: “bab”Note: “aba” is also a valid answer.Example 2:Input:原创 2020-07-03 09:25:02 · 235 阅读 · 0 评论 -
【leetcode】-83. Remove Duplicates from Sorted List移除排序链表中的重复元素
Remove Duplicates from Sorted List题目快慢指针python代码题目Given a sorted linked list, delete all duplicates such that each element appear only once.Example 1:Input: 1->1->2Output: 1->2Example 2:Input: 1->1->2->3->3Output: 1->2->3原创 2020-06-24 13:23:28 · 160 阅读 · 0 评论 -
【leetcode】-42. Trapping Rain Water困雨水
Trapping Rain Water题目暴力法备忘录优化双指针题目Given n non-negative integers representing an elevation map where the width of each bar is 1, compute how much water it is able to trap after raining.The above elevation map is represented by array [0,1,0,2,1,0,1,3,2,1原创 2020-06-24 12:46:34 · 125 阅读 · 0 评论 -
【leetcode】-1011. Capacity To Ship Packages Within D Days
Capacity To Ship Packages Within D Days题目二分法python代码题目A conveyor belt has packages that must be shipped from one port to another within D days.The i-th package on the conveyor belt has a weight of weights[i]. Each day, we load the ship with packages on原创 2020-06-24 10:37:25 · 184 阅读 · 0 评论 -
【leetcode】-875. Koko Eating Bananas 可可吃香蕉
Koko Eating Bananas题目二分查找python代码题目Koko loves to eat bananas. There are N piles of bananas, the i-th pile has piles[i] bananas. The guards have gone and will come back in H hours.Koko can decide her bananas-per-hour eating speed of K. Each hour, she原创 2020-06-23 14:43:50 · 279 阅读 · 0 评论 -
【leetcode】-372. Super Pow 超幂运算
Super Pow题目递归python代码题目Your task is to calculate ab mod 1337 where a is a positive integer and b is an extremely large positive integer given in the form of an array.Example 1:Input: a = 2, b = [3]Output: 8Example 2:Input: a = 2, b = [1,0]Output: 1原创 2020-06-22 23:15:26 · 412 阅读 · 0 评论 -
【leetcode】-204. Count Primes 计算素数
Count Primes题目埃氏筛法python代码题目Count the number of prime numbers less than a non-negative number, n.Example:Input: 10Output: 4Explanation: There are 4 prime numbers less than 10, they are 2, 3, 5, 7.埃氏筛法素数是只能被1和其本身整除的数,最小的素数就是2.埃拉托色尼筛选法(the Sieve of原创 2020-06-22 22:25:45 · 214 阅读 · 0 评论 -
【leetcode】-773. Sliding Puzzle 滑动迷道
Sliding Puzzle题目bfspython代码题目On a 2x3 board, there are 5 tiles represented by the integers 1 through 5, and an empty square represented by 0.A move consists of choosing 0 and a 4-directionally adjacent number and swapping it.The state of the board is s原创 2020-06-22 21:59:44 · 231 阅读 · 0 评论 -
【leetcode】-452. Minimum Number of Arrows to Burst Balloons射穿气球的最小数量
Minimum Number of Arrows to Burst Balloons题目贪心法python代码题目There are a number of spherical balloons spread in two-dimensional space. For each balloon, provided input is the start and end coordinates of the horizontal diameter. Since it’s horizontal, y-coor原创 2020-06-21 14:16:31 · 178 阅读 · 0 评论 -
【leetcode】-435. Non-overlapping Intervals 无重叠区间
Non-overlapping Intervals题目贪心法python代码题目Given a collection of intervals, find the minimum number of intervals you need to remove to make the rest of the intervals non-overlapping.Example 1:Input: [[1,2],[2,3],[3,4],[1,3]]Output: 1Explanation: [1,3] c原创 2020-06-21 14:00:23 · 255 阅读 · 0 评论 -
【leetcode】-1044. Longest Duplicate Substring 最长重复子串
Longest Duplicate Substring题目暴力法python代码二分法+Rabin-Karppython代码题目Given a string S, consider all duplicated substrings: (contiguous) substrings of S that occur 2 or more times. (The occurrences may overlap.)Return any duplicated substring that has the lo原创 2020-06-20 23:01:04 · 405 阅读 · 0 评论 -
【leetcode】-111. Minimum Depth of Binary Tree BFS算法
Minimum Depth of Binary Tree题目BFSpython代码题目Given a binary tree, find its minimum depth.The minimum depth is the number of nodes along the shortest path from the root node down to the nearest leaf node.Note: A leaf is a node with no children.Example:G原创 2020-06-19 14:25:54 · 163 阅读 · 0 评论 -
【leetcode】-51. N-Queens 回溯法解N皇后问题
N-Queens题目回溯法python 代码题目The n-queens puzzle is the problem of placing n queens on an n×n chessboard such that no two queens attack each other.Given an integer n, return all distinct solutions to the n-queens puzzle.Each solution contains a distinct bo原创 2020-06-19 14:13:26 · 219 阅读 · 0 评论 -
【leetcode】-46. Permutations 回溯法解全排列
Permutations题目回溯法python代码题目Given a collection of distinct integers, return all possible permutations.Example:Input: [1,2,3]Output:[[1,2,3],[1,3,2],[2,1,3],[2,3,1],[3,1,2],[3,2,1]]回溯法回溯法也称为树的深度优先遍历。树的深度优先遍历思想,就是遍历到不满足条件时返回访问其他节点。本题也可看作树的深度优原创 2020-06-19 13:21:26 · 204 阅读 · 0 评论 -
【leetcode】-877. Stone Game石子游戏 动态规划
Stone Game智力解法动态规划python代码#题目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 stones piles[i].The objective of the game is to end with the most stones. T原创 2020-06-18 21:46:03 · 131 阅读 · 0 评论 -
【leetcode】-516. Longest Palindromic Subsequence 求最长回文子序列
Longest Palindromic Subsequence题目动态规划python代码题目Given a string s, find the longest palindromic subsequence’s length in s. You may assume that the maximum length of s is 1000.Example 1:Input:“bbbab”Output:4One possible longest palindromic subsequence原创 2020-06-18 13:09:46 · 150 阅读 · 0 评论 -
【leetocde】-1143. Longest Common Subsequence最长公共子序列
Longest Common Subsequence题目动态规划python代码题目Given two strings text1 and text2, return the length of their longest common subsequence.A subsequence of a string is a new string generated from the original string with some characters(can be none) deleted wit原创 2020-06-18 12:41:09 · 187 阅读 · 0 评论 -
【leetcode】-312. Burst Balloons戳气球
312. Burst Balloons题目动态规划python代码题目Given n balloons, indexed from 0 to n-1. Each balloon is painted with a number on it represented by array nums. You are asked to burst all the balloons. If the you burst balloon i you will get nums[left] * nums[i] * num原创 2020-06-18 12:15:26 · 206 阅读 · 0 评论 -
【leetcode】-887. Super Egg Drop扔鸡蛋
887. Super Egg Drop题目思路思路一python 代码改进思路二python代码状态压缩题目You are given K eggs, and you have access to a building with N floors from 1 to N.Each egg is identical in function, and if an egg breaks, you cannot drop it again.You know that there exists a floor原创 2020-06-18 00:11:56 · 298 阅读 · 0 评论 -
【leetcode】-72. Edit Distance 编辑距离 python
72. Edit Distance题目动态规划python代码题目Given two words word1 and word2, find the minimum number of operations required to convert word1 to word2.You have the following 3 operations permitted on a word:Insert a characterDelete a characterReplace a character原创 2020-06-17 22:07:53 · 147 阅读 · 0 评论 -
leetcode-518. Coin Change 2零钱兑换2
518. Coin Change 2题目动态规划状态压缩题目Coin Change 2Medium188461Add to ListShareYou are given coins of different denominations and a total amount of money. Write a function to compute the number of combinations that make up that amount. You may assume tha原创 2020-06-17 20:47:39 · 181 阅读 · 0 评论 -
leetcode-416. Partition Equal Subset Sum切分为两相等子数组
Partition Equal Subset Sum题目动态规划状态压缩题目Given a non-empty array containing only positive integers, find if the array can be partitioned into two subsets such that the sum of elements in both subsets is equal.Note:Each of the array element will not exceed原创 2020-06-17 13:49:55 · 147 阅读 · 0 评论