2017年10月_nichchen

原创 42. Trapping Rain Water

Given n non-negative integers representing an elevation map where the width of each bar is 1, compute how much water it is able to trap after raining.For example, Given [0,1,0,2,1,0,1,3,2,1,2,1], ret

2017-10-31 13:03:33 257

转载 647. Palindromic Substrings（回文子字符串）

Given a string, your task is to count how many palindromic substrings in this string.The substrings with different start indexes or end indexes are counted as different substrings even they consist of

2017-10-21 21:04:14 348

转载 621. Task Scheduler（任务行程表）

Given a char array representing tasks CPU need to do. It contains capital letters A to Z where different letters represent different tasks.Tasks could be done without original order. Each task could be

2017-10-20 22:00:06 717

原创 31. Next Permutation （下一个排列）

Implement next permutation, which rearranges numbers into the lexicographically next greater permutation of numbers.If such arrangement is not possible, it must rearrange it as the lowest possible orde

2017-10-17 11:33:01 1038

原创 617. Merge Two Binary Trees（合并二叉树）

Given two binary trees and imagine that when you put one of them to cover the other, some nodes of the two trees are overlapped while the others are not.You need to merge them into a new binary tree. T

2017-10-16 11:39:21 284

转载 583. Delete Operation for Two Strings（两个字符串的删除操作）

Given two words word1 and word2, find the minimum number of steps required to make word1 and word2 the same, where in each step you can delete one character in either string.Example 1:Input: “sea”, “ea

2017-10-14 12:10:05 687

转载 572. Subtree of Another Tree （另一个树的子树）

Given two non-empty binary trees s and t, check whether tree t has exactly the same structure and node values with a subtree of s. A subtree of s is a tree consists of a node in s and all of this node’

2017-10-13 11:14:03 360

转载 543. Diameter of Binary Tree （二叉树的直径）

Given a binary tree, you need to compute the length of the diameter of the tree. The diameter of a binary tree is the length of the longestpath between any two nodes in a tree. This path may or may not

2017-10-11 10:56:21 364

转载 538. Convert BST to Greater Tree (将二叉搜索树BST转为较大树)

Given a Binary Search Tree (BST), convert it to a Greater Tree such that every key of the original BST is changed to the original key plus sum of all keys greater than the original key in BST.Example:

2017-10-10 12:09:05 258

转载 463. Island Perimeter 岛屿周长

You are given a map in form of a two-dimensional integer grid where 1 represents land and 0 represents water. Grid cells are connected horizontally/vertically (not diagonally). The grid is completely s

2017-10-09 21:13:02 468

Nick