懒人部落

Given a string, find the length of the longest substring without repeating characters. For example, the longest substring without repeating letters for "abcabcbb" is "abc", which the length is 3. Fo

Binary Tree Level Order Traversal二叉树的层序遍历两种方式：1、用两个queue交替表示每一层的节点2、用两个node，一个表示当前层的最后一个节点，一个表示下一层的最后一个节点/** * Definition for a binary tree node. * public class TreeNode { * int val;

Balanced Binary TreeGiven 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 subtre

Binary Search Tree IteratorImplement an iterator over a binary search tree (BST). Your iterator will be initialized with the root node of a BST.Calling next() will return the next smallest n

Binary Tree Inorder Traversal 即二叉树的中序遍历。常见的有两种方法：递归和循环，其中递归调用的栈空间为树的高度，一般为o(logn)，循环方式需要开辟一个栈来保存元素，空间复杂度也是o(logn)tips: 递归比循环耗时，递归：400ms，循环：220ms另外还以一种方式遍历二叉树：Morr

Reverse IntegerReverse digits of an integer.Example1: x = 123, return 321Example2: x = -123, return -321time=272ms acceptedpublic class Solution { public int reverse(int x) {

String to Integer (atoi)time=272ms   accepted 需考虑各种可能出现的情况public class Solution { public int atoi(String str) { int length=str.length(); long result=0

/** * Definition for singly-linked list. * public class ListNode { * int val; * ListNode next; * ListNode(int x) { * val = x; * next = null; * } * } */public

ZigZag ConversionThe string "PAYPALISHIRING" is written in a zigzag pattern on a given number of rows like this: (you may want to display this pattern in a fixed font for better legibility)P

Longest Palindromic SubstringGiven a string S, find the longest palindromic substring in S. You may assume that the maximum length of S is 1000, and there exists one unique longest palindrom

Palindrome Numbertime=434ms负数不是回文数public class Solution { public boolean isPalindrome(int x) { int palindrome=0; int revers=x; if(revers<0) return f

Median of Two Sorted ArraysThere 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)).ti

public class Solution { public int[] twoSum(int[] numbers, int target) { int length=numbers.length; int[] sortNum=new int[length]; sortNum=quickSort(numbers,0,length-1);

Binary Tree Maximum Path SumGiven 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,