原创 考研408專業課最重要的三個排序算法（堆排，歸併，快排）
#include <bits/stdc++.h> using namespace std; int myArray[1000]={0}; void arrayPrint(int arr[],int s,int e){ for(
2020-06-28 01:57:28
原创 1143 Lowest Common Ancestor
The lowest common ancestor (LCA) of two nodes U and V in a tree is the deepest node that has both U and V as descenda
2020-06-19 21:48:23
原创 1139 First Contact(三觀不正的垃圾題)
Unlike in nowadays, the way that boys and girls expressing their feelings of love was quite subtle in the early years.
2020-06-19 20:45:54
原创 string用scanf讀入（節省時間）
#include <iostream> #include <stdio.h> #include <string.h> using namespace std; int main() { string a; a.resiz
2020-06-15 14:12:26
原创 百度文字識別OCR接口使用
原文：https://www.meiwen.com.cn/subject/cyjvectx.html 動機&成品展示 最近，家裏老人有需要把圖片裏的文字識別讀取的功能，想要教他們用市面上功能齊全的 App，因爲功能挺複雜的，他們又不太會操
2020-06-10 17:20:02
1
原创 百度OCR（python）接口說明
接口說明 更新時間：2020-04-06 通用文字識別 用戶向服務請求識別某張圖中的所有文字 """ 讀取圖片 """ def get_file_content(filePath): with open(filePath, 'r
2020-06-10 17:20:02
1
原创 百度OCR接口（python）快速入門
安裝OCR Python SDK 支持Python版本：2.7.+ ,3.+ 安裝使用Python SDK有如下方式： 如果已安裝pip，執行pip install baidu-aip即可。 如果已安裝setuptools，執行pyt
2020-06-10 17:20:02
原创 1151 LCA in a Binary Tree
The lowest common ancestor (LCA) of two nodes U and V in a tree is the deepest node that has both U and V as descendant
2020-03-19 20:35:10
原创 1142 Maximal Clique
A clique is a subset of vertices of an undirected graph such that every two distinct vertices in the clique are adjacen
2020-03-18 01:29:03
原创 1130 Infix Expression
Given a syntax tree (binary), you are supposed to output the corresponding infix expression, with parentheses reflectin
2020-03-16 11:29:47
原创 1134 Vertex Cover (25分)
A vertex cover of a graph is a set of vertices such that each edge of the graph is incident to at least one vertex of
2020-03-16 11:29:37
原创 1135 Is It A Red-Black Tree
There is a kind of balanced binary search tree named red-black tree in the data structure. It has the following 5 prope
2020-03-16 11:29:37
原创 1127 ZigZagging on a Tree
Suppose that all the keys in a binary tree are distinct positive integers. A unique binary tree can be determined by a
2020-03-14 20:16:08
1
原创 1122 Hamiltonian Cycle
The "Hamilton cycle problem" is to find a simple cycle that contains every vertex in a graph. Such a cycle is called a
2020-03-14 20:16:08
原创 1124 Raffle for Weibo Followers
John got a full mark on PAT. He was so happy that he decided to hold a raffle（抽獎） for his followers on Weibo -- that is
2020-03-14 20:16:08