- 博客(7)
- 资源 (2)
- 收藏
- 关注
RSS订阅原创 不错的google搜索地址
谷歌搜索：http://gu1234.com/ Googlehttp://www.gfsoso.com/ 谷粉搜索https://www.sssis.com/ 谷歌搜索http://www.gugesou.cn/ 谷歌搜http://www.glgoo.com/http://www.fqgoogle.com/ 翻墙谷歌ht
2015-02-28 19:57:22
4958
原创 Decode Ways --- LeetCode
A message containing letters from A-Z is being encoded to numbers using the following mapping:'A' -> 1'B' -> 2...'Z' -> 26Given an encoded message containing digits, determine the total numb
2015-02-04 11:08:53
391
原创 Count and Say --- LeetCode
The count-and-say sequence is the sequence of integers beginning as follows:1, 11, 21, 1211, 111221, ...1 is read off as "one 1" or 11.11 is read off as "two 1s" or 21.21 is read off as
2015-02-04 10:19:48
514
原创 Copy List with Random Pointer --- LeetCode
A linked list is given such that each node contains an additional random pointer which could point to any node in the list or null.Return a deep copy of the list.解题思路：1.遍历链表，在旧节点后面插入同样的新节点，cop
2015-02-03 12:57:04
325
原创 Convert Sorted List to Binary Search Tree --- LeetCode
Given a singly linked list where elements are sorted in ascending order, convert it to a height balanced BST解题思路：中序递归遍历构造，每次遍历找到中间节点即为根节点，左边为左子树，右边为右子树。public class Solution { public
2015-02-03 10:52:32
398
原创 Convert Sorted Array to Binary Search Tree --- LeetCode
Given an array where elements are sorted in ascending order, convert it to a height balanced BST.解题思路：使用二叉搜索树的方式遍历数组，每次遍历数组中间节点为子树的根节点，递归遍历找出中间节点。/** * Definition for binary tree * public clas
2015-02-02 10:56:43
382
原创 Container With Most Water --- LeetCode
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 endpoints of line i is at (i, ai) and (i, 0). Fin
2015-02-02 10:20:14
345
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人