definition 第29页

python变量作用域

昨天学习了python的静态嵌套域，但是网上差了很多资料看了很多博客，也没有弄清除，最后还是得看PEP227.在PEP227中原文是这样说的： The Python 2.0 definition specifies

·2015-11-13 13:27

leetcode Sort List

如下： /** * Definition for singly-li

·2015-11-13 12:49

leetcode Insertion Sort List

/** * Definition for singly-linked list. * struct ListNode { * int val; *

·2015-11-13 12:48

leetcode[145] Binary Tree Postorder Traversal

实现后序遍历递归： /** * Definition for binary tree * struct TreeNode { * int val; * TreeNode

·2015-11-13 12:46

leetcode Binary Tree Preorder Traversal

可参见中序遍历Binary Tree Inorder Traversal 递归： /** * Definition for binary tree * struct TreeNode {

·2015-11-13 12:45

leetcode Linked List Cycle II

O(n)空间 /** * Definition for singly-linked list.

·2015-11-13 12:44

Leetcode Reorder List

/** * Definition for si

·2015-11-13 12:44

leetcode Linked List Cycle

一个指针跑一次，一个指针跑两次，相遇就是有环 /** * Definition for singly-linked list.

·2015-11-13 12:43

leetcode[138] Copy List with Random Pointer

/** * Definition for singly-linked list with a random pointer. *

·2015-11-13 12:41

leetcode[110] Balanced Binary Tree

/** * Definition for binary tree * struct TreeNode { * int val; * TreeNode *left; *

·2015-11-13 12:21

leetcode Convert Sorted List to Binary Search Tree

时间O(n)空间O(n)代码如下： /** * Definition for singly-linked list.

·2015-11-13 12:20

leetcode Convert Sorted Array to Binary Search Tree

/** * Definition for binary tree * struct TreeNode { * int val; * TreeNode *left; *

·2015-11-13 12:19

leetcode Maximum Depth of Binary Tree

递归： /** * Definition for binary tree * struct TreeNode { * int val; * TreeNode *left

·2015-11-13 12:16

leetcode[98] Validate Binary Search Tree

/** * Definition for binary tree *

·2015-11-13 12:11

leetcode[96] Binary Tree Inorder Traversal

我自己写的有点挫： /** * Definition for binary tree * struct TreeNode { * int val; * TreeNode

·2015-11-13 12:10

LeetCode: Sort List

merge sort 1 /** 2 * Definition for singly-linked list. 3 * struct ListNode { 4 * int

·2015-11-13 12:36

LeetCode: Reorder List

list的题最大的麻烦就在于细节，这题也是弄了挺久，思路很简单，双指针取终点，后面的list反向后搭一起就行了 1 /** 2 * Definition for singly-linked

·2015-11-13 12:33

LeetCode: Max Points on a Line

斜率问题 1 /** 2 * Definition for a point. 3 * struct Point { 4 * int x; 5 * int y

·2015-11-13 12:29

Insertion Sort List

这题一开始想新建一个list，结果MLE了，后来想了想不用新建，insertion的概念理解好就行，具体编程部分不难 1 /** 2 * Definition for singly-linked

·2015-11-13 12:28

LeetCode: Binary Tree Postorder Traversal

跟inorder差不多 1 /** 2 * Definition for binary tree 3 * struct TreeNode { 4 * int val;

·2015-11-13 12:26

LeetCode: Linked List Cycle

双指针的简单题 1 /** 2 * Definition for singly-linked list. 3 * struct ListNode { 4 * int val

·2015-11-13 12:25

LeetCode: Copy List with Random Pointer

跟clone graph思路一样 1 /** 2 * Definition for singly-linked list with a random pointer. 3 * struct

·2015-11-13 12:22

LeetCode: Clone Graph

1 /** 2 * Definition for undirected graph. 3 * struct UndirectedGraphNode { 4

·2015-11-13 12:21

Suffix array

The definition is similar to Suffix Tree which is compressed trie of all suffixes of the given text.

·2015-11-13 12:54

EXIT_SUCCESS_百度百科

EXIT_SUCCESS_百度百科 EXIT_SUCCESS 求助编辑百科名片 EXIT_SUCCESS是C语言头文件库中定义的一个符号常量，在vc++6.0下头文件stdlib.h中定义如下： /* Definition

·2015-11-13 12:06

leetcode[160] Intersection of Two Linked Lists

/** * Definition for

·2015-11-13 11:17

gcc: multiple definition of

SeamlessMessage/CPaoFlt.o: In function `CPaoFlt::get_m_strPrmair() const':CPaoFlt.cpp:(.text+0x0): multiple definition

·2015-11-13 11:47

oracle 体系结构 ----基本表空间介绍

系统表空间主要存放数据字典和内部系统表基表查看数据数据字典的SQL select * from dict 查看内部系统表的SQL select * from v$fixed_view_definition

·2015-11-13 11:58

LeetCode--Maximum Depth of Binary Tree

/** * Definition

·2015-11-13 11:00

LeetCode: Validate Binary Search Tree

看了别人的代码 1 /** 2 * Definition for binary tree 3 * struct TreeNode { 4 * int val; 5

·2015-11-13 11:47

LeetCode: Unique Binary Search Trees II

贴下自己写的不用指针的代码，更加容易懂吧 1 /** 2 * Definition for binary tree 3 * struct TreeNode { 4 * int

·2015-11-13 11:42

LeetCode: Symmetric Tree

看了网上答案 1 /** 2 * Definition for binary tree 3 * struct TreeNode { 4 * int val; 5 *

·2015-11-13 11:38

LeetCode: Swap Nodes in Pairs

一次过 1 /** 2 * Definition for singly-linked list. 3 * struct ListNode { 4 * int val;

·2015-11-13 11:37

LeetCode: Sum Root to Leaf Numbers

少数次过 1 /** 2 * Definition for binary tree 3 * struct TreeNode { 4 * int val; 5 *

·2015-11-13 11:36

LeetCode: Same Tree

一次过 1 /** 2 * Definition for binary tree 3 * struct TreeNode { 4 * int val; 5 *

·2015-11-13 11:24

LeetCode: Rotate List

两个边界条件没考虑到，少数次过 1 /** 2 * Definition for singly-linked list. 3 * struct ListNode { 4 *

·2015-11-13 11:23

LeetCode: Reverse Nodes in k-Group

1 /** 2 * Definition for singly-linked list. 3 * struct ListNode

·2015-11-13 11:22

LeetCode: Reverse Linked List II

没做出来，看网上答案，这题难度在于编程 1 /** 2 * Definition for singly-linked list. 3 * struct ListNode { 4

·2015-11-13 11:20

Linked List Cycle

/** * Definition for singly-linked list. * class ListNode { * int val; *

·2015-11-13 11:15

Common Object Structures

docs.python.org/3.3/c-api/structures.html There are a large number of structures which are used in the definition

·2015-11-13 10:36

装饰模式【设计模式学习-03】

Definition Attach additional responsibilities to an object dynamically.

·2015-11-13 10:52

LeetCode: Remove Nth Node From End of List

一次过 1 /** 2 * Definition for singly-linked list. 3 * struct ListNode { 4 * int val;

·2015-11-13 10:39

LeetCode: Remove Duplicates from Sorted List II

忘了边界条件，少数次过 1 /** 2 * Definition for singly-linked list. 3 * struct ListNode { 4 * int

·2015-11-13 10:37

LeetCode: Remove Duplicates from Sorted List

list比array更简单，一次过 1 /** 2 * Definition for singly-linked list. 3 * struct ListNode { 4 *