原创 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
2020-06-19 04:40:47
原创 leetCode 108.Convert Sorted Array to Binary Search Tree(將排序數組轉換爲BST) 解題思路和方法
Given an array where elements are sorted in ascending order, convert it to a height balanced BST. 思路：將排序數組轉換爲高度平衡的二叉搜索樹
2020-06-19 03:23:29
原创 leetCode 99.Recover Binary Search Tree(修正二叉搜索樹) 解題思路和方法
Two elements of a binary search tree (BST) are swapped by mistake. Recover the tree without changing its structure.
2020-06-19 02:11:54
原创 leetCode 98.Validate Binary Search Tree (有效二叉搜索樹) 解題思路和方法
Given a binary tree, determine if it is a valid binary search tree (BST). Assume a BST is defined as follows: The le
2020-06-19 02:11:43
1
原创 leetCode 105.Construct Binary Tree from Preorder and Inorder Traversal (根據前序遍歷和中序遍歷構造二叉樹)
Given preorder and inorder traversal of a tree, construct the binary tree. Note: You may assume that duplicates do no
2020-06-19 02:11:43
原创 2015阿里巴巴實習生招聘客戶端開發試題
2015-04-03，阿里巴巴暑期實習生招聘，第一輪，筆試，客戶端開發，在線測試，爲了可以給以後來的同學們一點經驗，特意把題目留下來了，希望可以給大家幫助。 技術類的題基本都一樣，大概是有一個題庫，雖然每個人的題目不一樣，但是還是會有
2020-06-19 02:11:43
原创 leetCode 103.Binary Tree Zigzag Level Order Traversal （二叉樹Z字形水平序） 解題思路和方法
Given a binary tree, return the zigzag level order traversal of its nodes' values. (ie, from left to right, then righ
2020-06-19 02:11:43
原创 leetCode 106.Construct Binary Tree from Inorder and Postorder Traversal (根據中序遍歷和後序遍歷構造二叉樹)
Given inorder and postorder traversal of a tree, construct the binary tree. Note: You may assume that duplicates do
2020-02-21 11:24:04
原创 leetCode 95.Unique Binary Search Trees II （唯一二叉搜索樹） 解題思路和方法
Given n, generate all structurally unique BST's (binary search trees) that store values 1...n. For example, Given n
2020-02-21 11:24:04
原创 android 百度地圖API 使用Marker和InfoWindow
前言：在android開發過程中，百度地圖的使用是比較普遍的，但是如何使用，使用什麼版本的百度API還是需要一些講究。 在項目過程中，需要用到百度地圖的marker和InfoWindow的功能。 標註覆蓋物（百度地圖官方圖） 佈局文件
2020-02-21 11:24:04
原创 leetCode 97.Interleaving String (交錯字符串) 解題思路和方法
Given s1, s2, s3, find whether s3 is formed by the interleaving of s1 and s2. For example, Given:s1 = "aabcc",s2 = "
2020-02-21 11:24:04
原创 leetCode 94.Binary Tree Inorder Traversal（二叉樹中序遍歷） 解題思路和方法
Given a binary tree, return the inorder traversal of its nodes' values. For example: Given binary tree {1,#,2,3},
2020-02-21 11:24:04
原创 leetCode 102.Binary Tree Level Order Traversal (二叉樹水平遍歷) 解題思路和方法
Given a binary tree, return the level order traversal of its nodes' values. (ie, from left to right, level by level).
2020-02-21 11:24:04
原创 leetCode 96.Unique Binary Search Trees (唯一二叉搜索樹) 解題思路和方法
Given n, generate all structurally unique BST's (binary search trees) that store values 1...n. For example, Given n
2020-02-21 11:24:04
原创 leetCode 101.Symmetric Tree（對稱樹） 解題思路和方法
Given a binary tree, check whether it is a mirror of itself (ie, symmetric around its center). For example, this bin
2020-02-21 11:24:04