LeetCode: Recover Binary Search Tree 解题报告
Recover Binary Search Tree Two elements of a binary search tree (BST) are swapped by mistake. Recover the tree without changing its structure. ...
原文：LeetCode: Word Search 解题报告
Word SearchGiven a D 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 are those horizontally or vertic ...
2014-10-21 15:10 1 3325 推荐指数：
相关推荐
LeetCode: Binary Search Tree Iterator 解题报告
Binary Search Tree Iterator Implement an iterator over a binary search tree (BST). Your iterator will be initialized ...
LeetCode: Validate Binary Search Tree 解题报告
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 ...
leetcode 解题报告 Word Ladder II
题目不多说了。见https://oj.leetcode.com/problems/word-ladder-ii/ 这一题我反复修改了两天半。尝试过各种思路，总是报TLE。终于知道这一题为什么是leetcode上通过率最低的一道题了，它对时限的要求实在太苛刻了。 在我AC版本代码的前一个版本 ...
LeetCode: Word Break II 解题报告
Word Break II Given a string s and a dictionary of words dict, add spaces in s to construct a sentence where each word is a valid dictionary word ...
LeetCode: Unique Binary Search Trees II 解题报告
Unique Binary Search Trees II Given n, generate all structurally unique BST's (binary search trees) that store values 1...n. For example, Given n ...
LeetCode: Lowest Common Ancestor of a Binary Search Tree 解题报告
https://leetcode.com/submissions/detail/32662938/ Given a binary search tree (BST), find the lowest common ancestor (LCA) of two given nodes ...
LeetCode 解题报告索引
最近在准备找工作的算法题，刷刷LeetCode，以下是我的解题报告索引，每一题几乎都有详细的说明，供各位码农参考。根据我自己做的进度持续更新中...... 本文地址 LeetCode:Reverse Words ...