LeetCode
文章平均质量分 62
ustcyy91
这个作者很懒,什么都没留下…
展开
-
Leetcode22-Generate Parentheses 之深入理解回溯算法
//具有限界条件的DFS算法称为回溯算法。先看题目 LeetCode的第22题:22. Generate ParenthesesGiven n pairs of parentheses, write a function to generate all combinations of well-formed parentheses.For example, given n = 3, a solut...原创 2018-03-12 14:48:05 · 1190 阅读 · 0 评论 -
LCS最长公共子序列与最长公共子串
import java.util.ArrayList; import java.util.List; public class Solution { public static void main(String[] args) { System.out.println(longestSub("abcde","aebacec")); ...原创 2018-06-19 15:22:05 · 194 阅读 · 0 评论 -
LeetCode-343 Integer Break整数拆分乘积最大
作为一道编程题,这道题还是很简单的。简单的观察就能知道拆出足够多的 3 就能使得乘积最大。int integerBreak(int n){ if(n == 2) return 1; if(n == 3) return 2; int ret = 1; while( n>4 ) { ret *= 3; n -= 3; ...转载 2018-06-16 14:28:30 · 412 阅读 · 0 评论 -
字符串-------最长回文串(leetcode5)
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:...原创 2018-04-27 21:48:35 · 231 阅读 · 0 评论 -
字符串-----最长不重复子字符串(leetcode3)
import java.util.HashMap;public class Solution { public int lengthOfLongestSubstring(String s) { //记录最大长度 int max=0; //left存放左边界 int left=0; HashMap<Character, Integer> map=new HashM...原创 2018-04-27 20:55:16 · 229 阅读 · 0 评论 -
leetcode113---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, 5 / \原创 2018-04-25 15:39:40 · 103 阅读 · 0 评论 -
leetcode112----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 binary tree and sum原创 2018-04-24 15:48:47 · 86 阅读 · 0 评论 -
leetcode111-Minimum Depth of Binary Tree(二叉树的最小深度)
题目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.分析求二叉树的最小深度:根节点到最近叶子节点的路原创 2018-04-24 15:35:07 · 115 阅读 · 0 评论 -
leetcode--230 Kth Smallest Element in a BST(二分搜索树第K小的值)
Given a binary search tree, write a function kthSmallest to find thekth smallest element in it.Note: You may assume k is always valid, 1 ≤ k ≤ BST's total elements.Follow up:What if the原创 2018-04-24 10:55:55 · 152 阅读 · 0 评论 -
LeetCode100——sameTree
/** * Definition for a binary tree node. * public class TreeNode { * int val; * TreeNode left; * TreeNode right; * TreeNode(int x) { val = x; } * } */class Solution { publ...原创 2018-04-23 22:16:58 · 121 阅读 · 0 评论 -
Leetcode----------区间合并(数组)
最近在做今日头条的笔试题碰到了区间合并问题所以趁机把类似的问题总结一下LeetCode 56 给出一个区间的集合,请合并所有重叠的区间。示例 1:输入: [[1,3],[2,6],[8,10],[15,18]]输出: [[1,6],[8,10],[15,18]]解释: 区间 [1,3] 和 [2,6] 重叠, 将它们合并为 [1,6].示例 2:输入: [[1...原创 2018-08-14 16:21:00 · 6030 阅读 · 0 评论