Day: July 24, 2018

Leetcode 200. Number of Islands 典型联通问题探讨

Leetcode 200. Number of Islands 典型联通问题探讨

题目大意 Given a 2d grid map of ‘1’s (land) and ‘0’s (water), count the number of islands. An island is surrounded by water and is formed by connecting adjacent lands horizontally or vertically. You may assume all four edges of the grid are all surrounded 

Leetcode 199 Binary Tree Right Side View 层次遍历变形

Leetcode 199 Binary Tree Right Side View 层次遍历变形

题目大意 Given a binary tree, imagine yourself standing on the right side of it, return the values of the nodes you can see ordered from top to bottom. Example: Input: [1,2,3,null,5,null,4] Output: [1, 3, 4] Explanation: 1 <— / \ 2 3 <— \ \ 

Leetcode 111. Minimum Depth of Binary Tree 深度优先递归遍历

Leetcode 111. Minimum Depth of Binary Tree 深度优先递归遍历

题意分析 Given a binary tree, find its minimum depth. The minimum depth is the number of nodes along the shortest path from the root node down to the nearest leaf node. Note: A leaf is a node with no children. Example: Given binary tree [3,9,20,null,null,15,7], 

Leetcode 107 Binary Tree Level Order Traversal II 层次遍历及其变形

Leetcode 107 Binary Tree Level Order Traversal II 层次遍历及其变形

题目分析 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,null,null,15,7], 3 / \ 9 20 / \ 15 7 return its bottom-up 

Leetcode 103 Binary Tree Zigzag Level Order Traversal 层次遍历变形

Leetcode 103 Binary Tree Zigzag Level Order Traversal 层次遍历变形

题目表述 Given a binary tree, return the zigzag level order traversal of its nodes’ values. (ie, from left to right, then right to left for the next level and alternate between). For example: Given binary tree [3,9,20,null,null,15,7], 3 / \ 9 20 / \ 15 

First Time with Akaso Brave 4K on the bike

First Time with Akaso Brave 4K on the bike

Biking from my apartment to mountainview public library in the sunshine.