2016 年 3月随笔档案 - dingjunnan

摘要：Given a binary tree, return the level order traversal of its nodes' values. (ie, from left to right, level by level). 阅读全文

posted @ 2016-03-13 17:00 dingjunnan 阅读(145) 评论(0) 推荐(0)

摘要：Given a binary tree, return the inorder traversal of its nodes' values. 阅读全文

posted @ 2016-03-13 13:37 dingjunnan 阅读(115) 评论(0) 推荐(0)

摘要：Given a binary tree, return the preorder traversal of its nodes' values. 阅读全文

posted @ 2016-03-13 13:30 dingjunnan 阅读(131) 评论(0) 推荐(0)

摘要：Given a binary tree, find its maximum depth. 阅读全文

posted @ 2016-03-13 13:20 dingjunnan 阅读(184) 评论(0) 推荐(0)

摘要：LintCode: Search in Rotated Sorted Array 阅读全文

posted @ 2016-03-13 00:24 dingjunnan 阅读(133) 评论(0) 推荐(0)

摘要：LintCode: First Bad Version 阅读全文

posted @ 2016-03-12 23:14 dingjunnan 阅读(125) 评论(0) 推荐(0)

摘要：LintCode : Find Minimum in Rotated Sorted Array 阅读全文

posted @ 2016-03-12 22:57 dingjunnan 阅读(122) 评论(0) 推荐(0)

摘要：Ubuntu switch window & switch terminal tab 阅读全文

posted @ 2016-03-04 14:48 dingjunnan 阅读(205) 评论(0) 推荐(0)

Junnan Ding