摘要：
You are asked to cut off trees in a forest for a golf event. The forest is represented as a non-negative 2D map, in this map: 0 represents the obstacl 阅读全文
阅读排行榜
[LeetCode] 590. N-ary Tree Postorder Traversal_Easy
2018-07-22 09:09 by Johnson_强生仔仔, 524 阅读, 收藏,
摘要：
Given an n-ary tree, return the postorder traversal of its nodes' values. For example, given a 3-ary tree: Return its postorder traversal as: [5,6,3,2 阅读全文
[LeetCode] 589. N-ary Tree Preorder Traversal_Easy
2018-07-22 03:55 by Johnson_强生仔仔, 477 阅读, 收藏,
摘要：
Given an n-ary tree, return the preorder traversal of its nodes' values. For example, given a 3-ary tree: Return its preorder traversal as: [1,3,5,6,2 阅读全文
[LeetCode] 139. Word Break_ Medium tag: Dynamic Programming
2019-04-26 11:08 by Johnson_强生仔仔, 465 阅读, 收藏,
摘要：
Given a non-empty string s and a dictionary wordDict containing a list of non-empty words, determine if s can be segmented into a space-separated sequ 阅读全文
[LeetCode] questions conlusion_InOrder, PreOrder, PostOrder traversal
2018-07-22 00:03 by Johnson_强生仔仔, 463 阅读, 收藏,
摘要：
Pre: node 先, Inorder: node in, Postorder: node 最后 PreOrder Inorder PostOrder node-> left -> right left -> node ->right left -> right ->node Recursive 阅读全文
浙公网安备 33010602011771号