关注
分享
leetcode等编程题，对应的题目和解决方法以及思路和代码实现，主要做日常的刷题记录和分享，方便大家面试使用以及保持手感使用~
逐风的小黄
人生要不断保持进步，不进步就会哭T﹏T！
展开
-
leetcode之construct-binary-tree-from-inorder-and-postorder-traversal(给定中序遍历和后序遍历，还原二叉树)
leetcode之construct-binary-tree-from-inorder-and-postorder-traversal(给定中序遍历和后序遍历，还原二叉树)题目Given inorder and postorder traversal of a tree, construct the binary tree.Note:You may assume that duplicat...原创 2019-06-12 00:03:22 · 207 阅读 · 0 评论 -
leetcode之binary-tree-level-order-traversal-ii(二叉树按照层次转化为二维数组)
leetcode之binary-tree-level-order-traversal-ii(二叉树按照层次转化为二维数组)题目Given a binary tree, return the bottom-up level order traversal of its nodes’ values. (ie, from left to right, level by level from leaf...原创 2019-06-09 20:11:36 · 421 阅读 · 0 评论 -
leetcode之convert-sorted-array-to-binary-search-tree(将递增数组转化为BST搜索二叉树)
leetcode之convert-sorted-array-to-binary-search-tree(将递增数组转化为BST搜索二叉树)题目Given an array where elements are sorted in ascending order, convert it to a height balanced BST.题意给定一个递增的连续数组，将其转化为一个BST搜索二叉...原创 2019-06-07 11:20:48 · 198 阅读 · 0 评论 -
leetcode之convert-sorted-list-to-binary-search-tree(将一个递增链表转化为一个搜索二叉树)
leetcode之convert-sorted-list-to-binary-search-tree(将一个递增链表转化为一个搜索二叉树)题目Given a singly linked list where elements are sorted in ascending order, convert it to a height balanced BST.题意给定一个递增的链表，然后将这...原创 2019-06-07 10:56:48 · 162 阅读 · 0 评论 -
leetcode之balanced-binary-tree(平衡二叉树判断)
leetcode之balanced-binary-tree(平衡二叉树判断)题目Given a binary tree, determine if it is height-balanced.For this problem, a height-balanced binary tree is defined as a binary tree in which the depth of the...原创 2019-06-07 00:33:21 · 142 阅读 · 0 评论 -
leetcode之path-sum
leetcode之path-sum题目Given a binary tree and a sum, determine if the tree has a root-to-leaf path such that adding up all the values along the path equals the given sum.For example:Given the below b...原创 2019-06-06 21:53:37 · 139 阅读 · 0 评论 -
leetcode之path-sum-ii（求所有和为固定值的二叉树路径）
leetcode之path-sum-ii（求所有和为固定值的二叉树路径）题目Given a binary tree and a sum, find all root-to-leaf paths where each path’s sum equals the given sum.For example:Given the below binary tree andsum = 22,re...原创 2019-06-05 23:01:14 · 342 阅读 · 0 评论 -
leetcode之distinct-subsequences(求字符串中子串的数量)
leetcode之distinct-subsequences(求字符串中子串的数量)题目Given a string S and a string T, count the number of distinct subsequences of T in S.A subsequence of a string is a new string which is formed from the o...原创 2019-06-05 20:23:39 · 829 阅读 · 0 评论 -
leetcode之populating-next-right-pointers-in-each-node-ii
leetcode之populating-next-right-pointers-in-each-node-ii题目Follow up for problem “Populating Next Right Pointers in Each Node”.What if the given tree could be any binary tree? Would your previous sol...原创 2019-06-05 19:39:37 · 127 阅读 · 0 评论 -
leetcode之pascals-triangle（杨辉三角-1）
leetcode之pascals-triangle（杨辉三角-1）题目Given numRows, generate the first numRows of Pascal’s triangle.For example, given numRows = 5,Return题意给定一个index k，返回高度为k的杨辉三角矩阵。解题思路直接按照杨辉三角的来源规则来就好，从上往下依次计...原创 2019-06-03 23:14:56 · 152 阅读 · 1 评论 -
leetcode之pascals-triangle-ii(杨辉三角)
leetcode之pascals-triangle-ii(杨辉三角)题目Given an index k, return the k th row of the Pascal’s triangle.For example, given k = 3,Return[1,3,3,1].Note:Could you optimize your algorithm to use only O(k...原创 2019-06-03 22:19:40 · 140 阅读 · 0 评论 -
leetcode之pascals-triangle-ii(杨辉三角)
leetcode之pascals-triangle-ii(杨辉三角)题目Given an index k, return the k th row of the Pascal’s triangle.For example, given k = 3,Return[1,3,3,1].Note:Could you optimize your algorithm to use only O(k...原创 2019-06-03 22:19:08 · 124 阅读 · 0 评论 -
leetcode之triangle(动态规划)
leetcode之triangle(动态规划)题目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],...原创 2019-06-02 20:10:54 · 224 阅读 · 0 评论 -
leetcode之binary-tree-maximum-path-sum
leetcode之binary-tree-maximum-path-sum题目Given a binary tree, find the maximum path sum.The path may start and end at any node in the tree.For example:Given the below binary tree,return 6；题意给出一...原创 2019-05-23 00:51:11 · 166 阅读 · 0 评论 -
leetcode之valid-palindrome(判断是否为回文字符
leetcode之valid-palindrome(判断是否为回文字符串)题目Given a string, determine if it is a palindrome, considering only alphanumeric characters and ignoring cases.For example,"A man, a plan, a canal: Panama"is a...原创 2019-05-22 21:45:04 · 266 阅读 · 0 评论 -
leetcode之word-ladder
leetcode之word-ladder题目Given two words (start and end), and a dictionary, find the length of shortest transformation sequence from start to end, such that:Only one letter can be changed at a timeEa...原创 2019-05-21 23:23:58 · 340 阅读 · 0 评论 -
剑指offer之二维数组的查找
剑指offer之二维数组的查找题目在一个二维数组中（每个一维数组的长度相同），每一行都按照从左到右递增的顺序排序，每一列都按照从上到下递增的顺序排序。请完成一个函数，输入这样的一个二维数组和一个整数，判断数组中是否含有该整数。解题思路这道题很简单，最简单的就是暴力求解，遍历整个数组看看是否有匹配的，我们需要想点优化的；那么这道题数组有个特点，那就是从上到下，从左到右 数组内的值都是递增的...原创 2019-05-21 00:21:53 · 77 阅读 · 0 评论 -
leetcode之longest-consecutive-sequence（求数组最长连续数长度）
leetcode之longest-consecutive-sequence（求数组最长连续数长度）题目Given an unsorted array of integers, find the length of the longest consecutive elements sequence.For example,Given[100, 4, 200, 1, 3, 2],The lo...原创 2019-05-19 19:24:23 · 377 阅读 · 0 评论 -
leetcode之sum-root-to-leaf-numbers
LeetCode之sum-root-to-leaf-numbers题目Given a binary tree containing digits from0-9only, each root-to-leaf path could represent a number.An example is the root-to-leaf path1->2->3which represent...原创 2019-05-19 19:00:07 · 159 阅读 · 0 评论 -
leetcode之surrounded-regions(将边界上非联通的O变为X)
leetcode之surrounded-regions(将边界上非联通的O变为X)题目Given a 2D board containing’X’and’O’, capture all regions surrounded by’X’.A region is captured by flipping all’O’s into’X’s in that surrounded region .F...原创 2019-05-15 20:48:44 · 188 阅读 · 0 评论 -
leetcode之palindrome-partitioning（求所有是回文数的子字符串组合的合集）
leetcode之palindrome-partitioning题目Given a string s, partition s such that every substring of the partition is a palindrome.Return all possible palindrome partitioning of s.For example, given s =“a...原创 2019-05-14 22:43:23 · 182 阅读 · 0 评论 -
leetcode之clone-graph复制图
leetcode之clone-graph复制图题目Clone an undirected graph. Each node in the graph contains alabeland a list of itsneighbors.OJ’s undirected graph serialization:Nodes are labeled uniquely.We use#as a sep...原创 2019-05-13 22:22:05 · 415 阅读 · 0 评论 -
leetcode之gas-station(求循环站是否可以到达终点，如果有返回对应的index)
题目There are N gas stations along a circular route, where the amount of gas at station i isgas[i].You have a car with an unlimited gas tank and it costscost[i]of gas to travel from station i to its n...原创 2019-04-30 00:43:29 · 156 阅读 · 0 评论 -
leetcode之candy(孩童分糖果，求糖果最小数量)
题 目There are N children standing in a line. Each child is assigned a rating value.You are giving candies to these children subjected to the following requirements:Each child must have at least one ...原创 2019-04-29 01:12:32 · 1067 阅读 · 0 评论 -
leedcode之copy-list-with-random-pointer(深层次拷贝随机链表)
题目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.解题思路这里的RandomListNode有一个特点，就是会有个...原创 2019-04-27 23:20:29 · 121 阅读 · 0 评论 -
leetcode之word-break(动态规划)
题目Given a string s and a dictionary of words dict, determine if s can be segmented into a space-separated sequence of one or more dictionary words.For example, givens =“leetcode”,dict =[“leet”, “c...原创 2019-04-27 00:08:02 · 304 阅读 · 0 评论 -
leetcode之linked-list-cycle-ii(判断链表是否循环，并其求出循环点)
题目Given a linked list, return the node where the cycle begins. If there is no cycle, returnnull.Follow up:Can you solve it without using extra space?解题步骤1、使用快慢指针，判断链表是否是循环链接，如果是，则求出快慢指针的相交点Z。2、将...原创 2019-04-25 00:53:44 · 298 阅读 · 0 评论