原创 B樹 （插入操作）
B樹 B樹的特性 一顆m階的B樹滿足一下特性 (一) 樹中的每個結點至多有m顆子樹，至少有顆子樹。（除根結點和葉子結點外），其中表示m/2向上取整。（） (二) 樹中的每個結點至少有個關鍵字，至多m-1個關鍵字。 當結點的關鍵字個數滿
2020-06-23 21:15:59
原创 LeetCode | Path Sum
Given a binary tree and a sum, determine if the tree has a root-to-leaf path such that adding up all the values along
2020-06-23 21:15:57
原创 Opencv2--顏色縮減（兩種方法實現 1.迭代器 2.指針）
// ColorReduce.cpp : Defines the entry point for the console application. /*-----CODE FOR FUN--------------- -------CRE
2020-06-23 21:15:57
原创 Opencv2--像素點操作（加噪聲）
// ReadPixels.cpp : Defines the entry point for the console application. /*-----CODE FOR FUN--------------- -------CREA
2020-06-23 21:15:57
原创 LeetCode | Same Tree
Given two binary trees, write a function to check if they are equal or not. Two binary trees are considered equal if
2020-06-23 21:15:57
原创 Opencv--圖像銳化處理
圖像銳化處理（兩種方法 1.過濾函數，自定義核 2. 直接處理當前像素點與鄰近像素點關係） // Sharpen.cpp : Defines the entry point for the console application. /*-
2020-06-23 21:15:55
原创 LeetCode | 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 ord
2020-06-23 21:15:55
原创 LeetCode | Balanced Binary Tree
Given a binary tree, determine if it is height-balanced. For this problem, a height-balanced binary tree is defined a
2020-06-23 21:15:55
原创 Leetcode | Symmetric Tree
Given a binary tree, check whether it is a mirror of itself (ie, symmetric around its center). For example, this bi
2020-02-24 10:19:24