瓦尔登湖

题目链接：maximal-rectangleimport java.util.Arrays;/** * Given a 2D binary matrix filled with 0's and 1's, * find the largest rectangle containing all ones and return its area. * */public cl

题目链接：validate-binary-search-tree //验证是否为二叉排序树/** * Given a binary tree, determine if it is a valid binary search tree (BST). Assume a BST is defined as follows: The left subtr

题目链接：n-queensimport java.util.ArrayList;import java.util.Arrays;import java.util.List;/** * The n-queens puzzle is the problem of placing n queens on an n×n chessboard such that no t

题目链接：symmetric-treeimport java.util.LinkedList;//判断该二叉树是否是对称二叉树/** * Given a binary tree, check whether it is a mirror of itself (ie, symmetric around its center). For example, this

题目链接：reverse-bitsimport java.util.Arrays;/** * Reverse bits of a given 32 bits unsigned integer. For example, given input 43261596 (represented in binary as 0000001010010100000111101

题目链接：jump-game/** * Given an array of non-negative integers, you are initially positioned at the first index of the array. Each element in the array represents your maximum jump length

题目链接：search-a-2d-matrix/** * Write an efficient algorithm that searches for a value in an m x n matrix. This matrix has the following properties: Integers in each row are sorted from le

题目链接：combination-sumimport java.util.ArrayList;import java.util.Arrays;import java.util.List;/** * Given a set of candidate numbers (C) and a target number (T), find all unique combin

题目链接：factorial-trailing-zeroes/** * Given an integer n, return the number of trailing zeroes in n!. Note: Your solution should be in logarithmic time complexity. * */public class

题目链接：implement-strstr/** * Implement strStr(). Returns the index of the first occurrence of needle in haystack, or -1 if needle is not part of haystack. * */public class Implement

题目链接：linked-list-cycle-ii/** * Given a linked list, return the node where the cycle begins. If there is no cycle, return null. Follow up: Can you solve it without using extra space?

题目链接：best-time-to-buy-and-sell-stock-iiiimport java.util.Arrays;/** * * Say you have an array for which the ith element is the price of a given stock on day i. * Design an algorithm to fi

题目链接：valid-sudokuimport java.util.Arrays;/** * Determine if a Sudoku is valid, according to: Sudoku Puzzles - The Rules. The Sudoku board could be partially filled, where empty cells

题目链接：letter-combinations-of-a-phone-numberimport java.util.ArrayList;import java.util.Arrays;import java.util.List;/** * Given a digit string, return all possible letter combinations tha

题目链接：multiply-stringsimport java.util.Arrays;/** * Given two numbers represented as strings, return multiplication of the numbers as a string. Note: The numbers can be arbitrarily lar

题目链接：candyimport java.util.Arrays;/** * 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 follo

题目链接：powx-n/** * Implement pow(x, n). * */public class PowXN {// 299 / 299 test cases passed.// Status: Accepted// Runtime: 343 ms// Submitted: 0 minutes ago static double po

题目链接：word-search/** * Given a 2D board and a word, find if the word exists in the grid. The word can be constructed from letters of sequentially adjacent cell, where "adjacent" cells

题目链接：excel-sheet-column-number/** * Related to question Excel Sheet Column Title * Given a column title as appear in an Excel sheet, return its corresponding column number. * For example:

题目链接：remove-element/** * * Given an array and a value, remove all instances of that value in place and return the new length. * * The order of elements can be changed. It doesn't matter wha

题目链接：3sum-closestimport java.util.Arrays;/** * * Given an array S of n integers, find three integers in S such that the sum is closest to a given number, target. * Return the sum of the

题目链接：populating-next-right-pointers-in-each-node/** * Given a binary tree struct TreeLinkNode { TreeLinkNode *left; TreeLinkNode *right; TreeLinkNode *next; }

题目链接：linked-list-cycle/** * * Given a linked list, determine if it has a cycle in it. * Follow up: * Can you solve it without using extra space? * */public class LinkedListCycle { pu

题目链接:longest-substring-without-repeating-characters/** * * Given a string S, find the longest palindromic substring in S. * You may assume that the maximum length of S is 1000, * and ther

题目链接：search-in-rotated-sorted-array-ii/** * * Follow up for "Search in Rotated Sorted Array": * What if duplicates are allowed? * * Would this affect the run-time complexity? How and why?

题目链接：find-minimum-in-rotated-sorted-array有待继续优化代码结构，但是已经AC了/** * Suppose a sorted array is rotated at some pivot unknown to you beforehand. (i.e., 0 1 2 4 5 6 7 might become 4 5 6

题目链接：convert-sorted-array-to-binary-search-tree/** * Given an array where elements are sorted in ascending order, convert it to a height balanced BST. * */public class ConvertSortedArray

题目链接：climbing-stairs/** * You are climbing a stair case. It takes n steps to reach to the top. Each time you can either climb 1 or 2 steps. In how many distinct ways can you climb to th

题目链接：binary-tree-preorder-traversalimport java.util.ArrayList;import java.util.List;import java.util.Stack;/** * Given a binary tree, return the preorder traversal of its nodes' values.

题目链接：unique-binary-search-treesimport java.util.Arrays;/** * Given n, how many structurally unique BST's (binary search trees) that store values 1...n? For example, Given n = 3, th

题目链接：maximum-subarray/** * 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], t

题目链接：search-insert-position有待继续优化/** * * 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

题目链接：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. * */public class Conve

题目链接：binary-tree-postorder-traversalimport java.util.ArrayList;import java.util.List;import java.util.Stack;/** * Given a binary tree, return the postorder traversal of its nodes' valu

题目链接：majority-element/** * Given an array of size n, find the majority element. The majority element is the element that appears more than ⌊ n/2 ⌋ times. You may assume that the arra

题目链接：populating-next-right-pointers-in-each-node-ii相同题型：Populating Next Right Pointers in Each Nodeimport java.util.LinkedList;/** * Follow up for problem "Populating Next Right Poin

题目链接：sort-list/** * Sort a linked list in O(n log n) time using constant space complexity. * */public class SortList { public class ListNode { int val; ListNode next; ListNode(in

题目链接：flatten-binary-tree-to-linked-listimport java.util.Stack;/** * Given a binary tree, flatten it to a linked list in-place. For example, Given 1 / \

题目链接：generate-parenthesesimport java.util.ArrayList;import java.util.List;/** * Given n pairs of parentheses, write a function to generate all combinations of well-formed parentheses.

题目链接：container-with-most-water/** * Given n non-negative integers a1, a2, ..., an, where each represents a point at coordinate (i, ai). n vertical lines are drawn such that the two endpoi