地址转换函数inet_addr(), inet_aton(), inet_ntoa()和inet_ntop(), inet_pton()

发表于 2017-01-15 | 分类于网络编程 | | 阅读次数:

对于地址转换函数，BSD网络软件包含inet_addr(), inet_aton()和inet_ntoa()三个函数用于二进制地址格式与点分十进制之间的相互转换，但是仅仅适用于IPv4，两个新函数inet_ntop()和inet_pton()具有相似的功能，并且同时支持IPv4和IPv6。

阅读全文 »

LeetCode Tree II

发表于 2017-01-12 | 分类于 LeetCode | | 阅读次数:

本文包含如下题目：
114. Flatten Binary Tree to Linked List
116. Populating Next Right Pointers in Each Node
117. Populating Next Right Pointers in Each Node II
124. Binary Tree Maximum Path Sum
129. Sum Root to Leaf Numbers
144. Binary Tree Preorder Traversal
145. Binary Tree Postorder Traversal
173. Binary Search Tree Iterator
199. Binary Tree Right Side View
222. Count Complete Tree Nodes
226. Invert Binary Tree
230. Kth Smallest Element in a BST
235. Lowest Common Ancestor of a Binary Search Tree
236. Lowest Common Ancestor of a Binary Tree
257. Binary Tree Paths
297. Serialize and Deserialize Binary Tree
337. House Robber III
404. Sum of Left Leaves
449. Serialize and Deserialize BST
450. Delete Node in a BST

阅读全文 »

LeetCode Tree I

发表于 2017-01-05 | 分类于 LeetCode | | 阅读次数:

本文包含的题目有：

94. Binary Tree Inorder Traversal
95. Unique Binary Search Trees II
96. Unique Binary Search Trees
98. Validate Binary Search Tree
99. Recover Binary Search Tree
100. Same Tree
101. Symmetric Tree
102. Binary Tree Level Order Traversal
103. Binary Tree Zigzag Level Order Traversal
104. Maximum Depth of Binary Tree
105. Construct Binary Tree from Preorder and Inorder Traversal
106. Construct Binary Tree from Inorder and Postorder Traversal
107. Binary Tree Level Order Traversal II
108. Convert Sorted Array to Binary Search Tree
110. Balanced Binary Tree
111. Minimum Depth of Binary Tree
112. Path Sum
113. Path Sum II
437. Path Sum III

阅读全文 »

Ubuntu14.04系统Chromium安装Adobe Flash插件

发表于 2017-01-04 | 分类于 Ubuntu | | 阅读次数:

经历了好几次重装Ubuntu系统，每次安装都需要配置一大堆东西，对于一个几乎放弃了windows系统的人来说，每次重装系统的第一件事就是安装一个Chromium浏览器，谁让我的所有收藏夹都在Chromium账号中。然而每次安装Chromium的Flash插件都需要去网上查找各种教程，每次都要搞好久才能弄好，这次专门记录一下，以便以后需要时用到。

阅读全文 »