个人学习笔记
tomkboya
这个作者很懒,什么都没留下…
展开
-
Binary Tree Preorder Traversal
题目描述: Given a binary tree, return the preorder traversal of its nodes' values. For example: Given binary tree {1,#,2,3}, return [1,2,3]. Note: Recursive solution is trivial, could you do it itera原创 2014-07-04 20:39:08 · 353 阅读 · 0 评论 -
Binary Tree Level Order Traversal
Given a binary tree, return the level order traversal of its nodes' values. (ie, from left to right, level by level). For example: Given binary tree {3,9,20,#,#,15,7}, return its level order tra原创 2014-07-04 21:31:26 · 397 阅读 · 0 评论 -
Binary Tree Postorder Traversal
题目描述: Given a binary tree, return the postorder traversal of its nodes' values. For example: Given binary tree {1,#,2,3}, return [3,2,1]. Note: Recursive solution is trivial, could you do it i原创 2014-07-04 21:11:43 · 291 阅读 · 0 评论 -
Reverse Integer
Reverse digits of an integer. Example1: x = 123, return 321 Example2: x = -123, return -321原创 2014-07-04 13:10:56 · 317 阅读 · 0 评论 -
Longest Palindromic Substring
题目描述:原创 2014-07-04 12:32:48 · 305 阅读 · 0 评论 -
Add Two Numbers
题目描述: You are given two linked lists representing two non-negative numbers. The digits are stored in reverse order and each of their nodes contain a single digit. Add the two numbers and return it as原创 2014-07-04 11:08:08 · 383 阅读 · 0 评论 -
Longest Substring Without Repeating Characters
题目描述: 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原创 2014-07-04 10:33:26 · 380 阅读 · 0 评论 -
LeetCode Two Sum
题目描述: Given an array of integers, find two numbers such that they add up to a specific target number. The function twoSum should return indices of the two numbers such that they add up to the target原创 2014-07-04 09:14:38 · 354 阅读 · 0 评论 -
Binary Tree Inorder Traversal
题目描述原创 2014-07-04 20:12:09 · 359 阅读 · 0 评论