leetcode算法题解(Java版)-16-动态规划(单词包含问题)
一、递归 题目描述 Given two binary trees, write a function to check if they are equal or not. Two binary trees are considered equal if they are structurally identical and the nodes have the same value. 思路 碰到....
leetcode算法题解(Java版)-15-动态规划(斐波那契)
一、二叉树遍历 题目描述 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 two subtrees of every node ....
leetcode算法题解(Java版)-14-第k小数问题
一、第k小数问题 题目描述 There are two sorted arrays A and B of size m and n respectively. Find the median of the two sorted arrays. The overall run time complexity should be O(log (m+n)). 思路 题目要求在O(log(m+n))时.....
leetcode算法题解(Java版)-13-经典反转链表
一、简单二分搜索 题目描述 Given a sorted array and a target value, return the index if the target is found. If not, return the index where it would be if it were inserted in order. You may assume no duplicates i....
leetcode算法题解(Java版)-12-中序遍历
日子又恢复正常了，浪了半个月。。。还是学习的时候感觉好~~ 一、动态规划 题目描述 Given n, how many structurally unique BST's (binary search trees) that store values 1...n? For example,Given n = 3, there are a total of 5 unique BST's. 1...
leetcode算法题解(Java版)-11-贪心大法
一、全排列变式（递归） 题目描述 Given a collection of numbers that might contain duplicates, return all possible unique permutations. For example,[1,1,2]have the following unique permutations:[1,1,2],[1,2,1], and[2....
leetcode算法题解(Java版)-10-全排列(递归)
一、二维数据 题目描述 You are given an n x n 2D matrix representing an image. Rotate the image by 90 degrees (clockwise). Follow up:Could you do this in-place? 思路 最简单的方法就是在开一个新二维数组tem,然后实行“旋转操作” 这样，不符合题意！要在同一.....
leetcode算法题解(Java版)-9-N皇后问题
一、贪心 题目描述 Find the contiguous subarray within an array (containing at least one number) which has the largest sum. For example, given the array[−2,1,−3,4,−1,2,1,−5,4],the contiguous subarray[4,−1,2,1....
leetcode算法题解(Java版)-8-动态规划+状态压缩
一、树 题目描述 Given a binary tree struct TreeLinkNode { TreeLinkNode *left; TreeLinkNode *right; TreeLinkNode *next; } Populate each next pointer to point to its next right node...
leetcode算法题解(Java版)-7-循环链表
一、循环链表 题目描述 Given a linked list, determine if it has a cycle in it. Follow up:Can you solve it without using extra space? 思路 不能用多余空间，刚开始没有考虑多个指针什么，一下子想到个歪点子：循环就是重复走，那我可以标记一下每次走过的路，如果遇到标记过的路，那说明就是有回路了....
本页面内关键词为智能算法引擎基于机器学习所生成，如有任何问题，可在页面下方点击"联系我们"与我们沟通。
LeetCode java相关内容
LeetCode您可能感兴趣
- LeetCode go语言
- LeetCode电话号码
- LeetCode力扣
- LeetCode路径
- LeetCode解析
- LeetCode字母
- LeetCode二叉树
- LeetCode温度
- LeetCode结构
- LeetCode bst
- LeetCode刷题
- LeetCode算法
- LeetCode链表
- LeetCode数组
- LeetCode字符串
- LeetCode python
- LeetCode元素
- LeetCode offer
- LeetCode面试
- LeetCode代码
- LeetCode单词
- LeetCode排序
- LeetCode实战
- LeetCode tree
- LeetCode算法解析
- LeetCode栈
- LeetCode有序数组
- LeetCode节点
- LeetCode golang
- LeetCode二叉搜索树
算法编程
开发者社区在线编程频道官方技术圈。包含算法资源更新，周赛动态，每日一题互动。
+关注