u012957549的博客

在刷leetcode 很多树题目的时候经常遇到这种情况，For example:Given BST [1,null,2,2], 1 \ 2 / 2发现测试的例子给的是一个数组 然而 需要输入的结果是一个树形结构每次手动的去创建比较麻烦，写了一个数组到树的一个小工具由于其中有null 的情况所以用的是装箱类，实现过程也比较简单，就是先创建根节点然后在...

题目：https://leetcode.com/problems/combination-sum-ii/这题主要是使用数组里面的数字求出期望数字的组合可能这个要多一个去重下面是官方给出的例子Example 1:Input: candidates = [10,1,2,7,6,1,5], target = 8,A solution set is:[ [1, 7], [1, 2, ...

题目：https://leetcode.com/problems/combination-sum/这题主要是使用数组里面的数字求出期望数字的组合可能下面是官方给出的例子：Example 1:Input: candidates = [2,3,6,7], target = 7,A solution set is:[ [7], [2,2,3]]Example 2:Input...

题目链接：https://leetcode.com/problems/container-with-most-water/description/ 文章地址： 项目源码：https://github.com/haha174/daylx Given n non-negative integers a1, a2, ..., an, where each represents a point at

题目链接：https://leetcode.com/problems/3sum/description/项目源码：https://github.com/haha174/daylx 假设3sum问题的目标是target。每次从数组中选出一个数k，从剩下的数中求目标等于target-k的2sum问题。这里需要注意的是有个小的trick：当我们从数组中选出第i数时，我们只需要求数值中从第i+1个到最后一

Regular Expression Matching

题目链接：https://leetcode.com/problems/zigzag-conversion/description/ 文章地址： 项目源码：https://github.com/haha174/daylx 其实这题：用case 数据反而不容易观察 不妨使用123456789当row=1 =>123456789当row=2 :1 3 5 7 92 4 6 ...

众所周知创建线程主要有两种方式一种是继承Thread 类一种是实现Runnable接口

题目描述 There are two sorted arrays nums1 and nums2 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)).Example 1:nums1 = [1, 3]

Given a string s, find the longest palindromic substring in s. You may assume that the maximum length of s is 1000.Example:Input: “babad”Output: “bab”Note: “aba” is also a valid answer.Example:Input: “

You are given two non-empty linked lists representing two non-negative integers. The digits are stored in reverse order and each of their nodes contain a single digit. Add the two numbers and return it

LeetCode(3):Given a string, find the length of the longest substring without repeating characters.