摘要: Given a binary tree, return all root-to-leaf paths. Note: A leaf is a node with no children. Example: Idea: traverse solution (inorder postorder, preo 阅读全文
posted @ 2018-05-13 14:28 wz30 阅读(218) 评论(0) 推荐(0) 编辑
摘要: beautiful arrangement backtracking for each position check each number. set number to one position 阅读全文
posted @ 2018-05-13 11:11 wz30 阅读(133) 评论(0) 推荐(0) 编辑