It’s been a long time since my last blog post. Here is my recent one on Medium: ProvenLogs is a simple yet performant logging service built…
I just wrote my first Atom extension called file-header. It allows you to customize, add, update and cooperate your authoring information in header…
I came across a problem on leetcode a few days ago. It asked me to implement a simple regex (regular expression) matcher which supports both . and *…
Problem Statement Given a binary tree, return the bottom-up level order traversal of its nodes’ values. (ie, from left to right, level by level from leaf to root). For example: Given binary tree {3,9,20,#,#,15,7},
|
1 2 3 4 5 |
3 / \ 9 20 / \ 15 7 |
return its bottom-up level order traversal as:
|
1 2 3 4 5 |
[ [15,7], [9,20], [3] ] |
Original LeetCode problem page My Solution in Swift Continue reading...
Problem Statement Given a binary tree, return the level order traversal of its nodes’ values. (ie, from left to right, level by level). For example: Given binary tree {3,9,20,#,#,15,7},
|
1 2 3 4 5 |
3 / \ 9 20 / \ 15 7 |
return its level order traversal as:
|
1 2 3 4 5 |
[ [3], [9,20], [15,7] ] |
Original LeetCode problem page My Solution in Swift Continue reading...