2019年4月19日
leetcode [144]Binary Tree Preorder Traversal
摘要： Given a binary tree, return the preorder traversal of its nodes' values. Example: Input: [1,null,2,3] 1 \ 2 / 3 Output: [1,2,3] Follow up: Recursive s 阅读全文
posted @ 2019-04-19 21:09 小白兔云 阅读(124) 评论(0) 推荐(0)
leetcode [143]Reorder List
摘要： Given a singly linked list L: L0→L1→…→Ln-1→Ln,reorder it to: L0→Ln→L1→Ln-1→L2→Ln-2→… You may not modify the values in the list's nodes, only nodes its 阅读全文
posted @ 2019-04-19 20:56 小白兔云 阅读(126) 评论(0) 推荐(0)
leetcode [139]Word Break
摘要： Given a non-empty string s and a dictionary wordDict containing a list of non-emptywords, determine if s can be segmented into a space-separated seque 阅读全文
posted @ 2019-04-19 11:37 小白兔云 阅读(141) 评论(0) 推荐(0)
leetcode [142]Linked List Cycle II
摘要： Given a linked list, return the node where the cycle begins. If there is no cycle, return null. To represent a cycle in the given linked list, we use 阅读全文
posted @ 2019-04-19 11:01 小白兔云 阅读(113) 评论(0) 推荐(0)