2013年计划 - 走看看

zoukankan html css js c++ java

2013年计划
一.学习
1. 读技术类书10本(1本/月)
2. 写博客日记,每周不低于5篇
3. 学习cocos2d-x平台,完成例子代码.并能复刻
4. 学习游戏策划相关知识
5. Just do it, don't think about it overly.
二.生活
1. 每天坚持做俯卧撑,站桩.周末慢跑2公里
2. 每周学会做1道新菜
3. 争取在北京买1套房
4. 希望摇号尽快中签
查看全文

相关阅读:
Data Structure Binary Tree: Populate Inorder Successor for all nodes
Data Structure Binary Tree: Connect nodes at same level using constant extra space
Data Structure Binary Tree: Check if a given Binary Tree is SumTree
Data Structure Binary Tree: Construct Tree from given Inorder and Preorder traversals
Data Structure Binary Tree: Inorder Tree Traversal without recursion and without stack!
Data Structure Binary Tree: Inorder Tree Traversal without Recursion
Data Structure Binary Tree: How to determine if a binary tree is height-balanced?
Data Structure Binary Tree: Diameter of a Binary Tree
Data Structure Binary Tree: Convert an arbitrary Binary Tree to a tree that holds Children Sum Property
【阿里云产品公测】OpenSearch初体验

原文地址：https://www.cnblogs.com/neking/p/2892537.html

Copyright © 2011-2022 走看看