随笔分类 -  LeetCode

上一页 1 2 3 4 5 下一页
[LeetCode] Reverse Linked List
摘要：Reverse a singly linked list. 1 /** 2 * Definition for singly-linked list. 3 * struct ListNode { 4 * int val; 5 * ListNode *next; 6 * ... 阅读全文
posted @ 2015-09-03 15:14 vincently 阅读(156) 评论(0) 推荐(0)
[LeetCode] Lowest Common Ancestor of a Binary Search Tree
摘要：Given a binary search tree (BST), find the lowest common ancestor (LCA) of two given nodes in the BST.According to the definition of LCA on Wikipedia:... 阅读全文
posted @ 2015-09-02 16:46 vincently 阅读(199) 评论(0) 推荐(0)
[LeetCode] Kth Smallest Element in a BST
摘要：Given a binary search tree, write a function kthSmallest to find the kth smallest element in it.Note: You may assume k is always valid, 1 ≤ k ≤ BST's ... 阅读全文
posted @ 2015-09-02 15:36 vincently 阅读(186) 评论(0) 推荐(0)
[LeetCode] Lowest Common Ancestor of a Binary Tree
摘要：Given a binary tree, find the lowest common ancestor (LCA) of two given nodes in the tree.According to the definition of LCA on Wikipedia: “The lowest... 阅读全文
posted @ 2015-09-01 00:10 vincently 阅读(438) 评论(0) 推荐(0)
[Leetcode] Binary Tree Paths
摘要：Given a binary tree, return all root-to-leaf paths.For example, given the following binary tree: 1 / \2 3 \ 5All root-to-leaf paths are:["1->... 阅读全文
posted @ 2015-08-30 17:04 vincently 阅读(225) 评论(0) 推荐(0)
[Leetcode] Permutations II
摘要：Given a collection of numbers that might contain duplicates, return all possible unique permutations. For example,[1,1,2] have the following unique pe... 阅读全文
posted @ 2015-08-30 15:41 vincently 阅读(137) 评论(0) 推荐(0)
[LeetCode] Permutations
摘要：Given a collection of numbers, return all possible permutations. For example,[1,2,3] have the following permutations:[1,2,3], [1,3,2], [2,1,3], [2,3,1... 阅读全文
posted @ 2015-08-30 14:58 vincently 阅读(206) 评论(0) 推荐(0)
[LeetCode] Balanced Binary Tree
摘要：Given 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... 阅读全文
posted @ 2015-08-09 21:14 vincently 阅读(163) 评论(0) 推荐(0)
[LeetCode] N-Queens
摘要：The n-queens puzzle is the problem of placing n queens on an n×n chessboard such that no two queens attack each other.Given an integer n, return all d... 阅读全文
posted @ 2015-08-08 23:44 vincently 阅读(278) 评论(0) 推荐(0)
[LeetCode] Longest Common Prefix
摘要：Write a function to find the longest common prefix string amongst an array of strings. 1 class Solution { 2 public: 3 string longestCommonPrefix(v... 阅读全文
posted @ 2015-04-16 19:41 vincently 阅读(151) 评论(0) 推荐(0)
[LeetCode] strStr
摘要：Implement strStr().Returns the index of the first occurrence of needle in haystack, or -1 if needle is not part of haystack.Update (2014-11-02):The si... 阅读全文
posted @ 2015-04-16 17:20 vincently 阅读(155) 评论(0) 推荐(0)
[LeetCode] Valid Palindrome
摘要：Given a string, determine if it is a palindrome, considering only alphanumeric characters and ignoring cases.For example,"A man, a plan, a canal: Pana... 阅读全文
posted @ 2015-04-16 17:05 vincently 阅读(155) 评论(0) 推荐(0)
[LeetCode] MaximumDepth of Binary Tree
摘要：Given a binary tree, find its maximum depth.The maximum depth is the number of nodes along the longest path from the root node down to the farthest le... 阅读全文
posted @ 2015-02-26 20:59 vincently 阅读(132) 评论(0) 推荐(0)
[LeetCode] Minimum Depth of Binary Tree
摘要：Given a binary tree, find its minimum depth.The minimum depth is the number of nodes along the shortest path from the root node down to the nearest le... 阅读全文
posted @ 2015-02-26 20:54 vincently 阅读(182) 评论(0) 推荐(0)
二叉树相关题目总结
摘要：1. 简要介绍 关于二叉树问题，由于其本身固有的递归属性，通常我们可以用递归算法来解决。（《编程之美》，P253） 总结的题目主要以leetcode题目、《剑指offer》以及《编程之美》的题目。2. 测试用例 普通二叉树（完全二叉树，不完全二叉树) 特殊二叉树（所有节点都没有右子节点的二... 阅读全文
posted @ 2015-02-26 19:44 vincently 阅读(844) 评论(0) 推荐(0)
[LeetCode] 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.解法：自底向上 时间复杂度O(n), 空间复杂度O(logN) 1 clas... 阅读全文
posted @ 2015-02-26 19:16 vincently 阅读(212) 评论(0) 推荐(0)
[LeetCode] 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 maximu... 阅读全文
posted @ 2015-02-25 20:28 vincently 阅读(126) 评论(0) 推荐(0)
[LeetCode] Sqrt(x)
摘要：Implementint sqrt(int x).Compute and return the square root ofx.解法：二分搜索 时间复杂度O(logN), 空间复杂度O(1) 1 class Solution { 2 public: 3 int mySqrt(int x)... 阅读全文
posted @ 2015-02-25 19:04 vincently 阅读(236) 评论(0) 推荐(0)
[LeetCode] Rotate Array
摘要：Rotate an array ofnelements to the right byksteps.For example, withn= 7 andk= 3, the array[1,2,3,4,5,6,7]is rotated to[5,6,7,1,2,3,4].Note:Try to come... 阅读全文
posted @ 2015-02-25 18:41 vincently 阅读(642) 评论(0) 推荐(0)
[LeetCode] Recover Binary Search Tree
摘要：Two elements of a binary search tree (BST) are swapped by mistake.Recover the tree without changing its structure.Note:A solution using O(n) space is ... 阅读全文
posted @ 2015-01-21 22:03 vincently 阅读(195) 评论(0) 推荐(0)

上一页 1 2 3 4 5 下一页