lypbendlf - 博客园

2018年11月19日

摘要： Suppose that all the keys in a binary tree are distinct positive integers. Given the preorder and inorder traversal sequences, you are supposed to out 阅读全文

posted @ 2018-11-19 18:47 lypbendlf 阅读(200) 评论(0) 推荐(0)

PAT 1031 Hello World for U[一般]

摘要： Given any string of N (≥5) characters, you are asked to form the characters into the shape of U. For example, helloworld can be printed as: h d e l l 阅读全文

posted @ 2018-11-19 17:20 lypbendlf 阅读(114) 评论(0) 推荐(0)

PAT 1142 Maximal Clique[难]

摘要： A clique is a subset of vertices of an undirected graph such that every two distinct vertices in the clique are adjacent. A maximal clique is a clique 阅读全文

posted @ 2018-11-19 16:41 lypbendlf 阅读(182) 评论(0) 推荐(0)

香农熵学习+例子[转载]

摘要：转自：https://www.cnblogs.com/wyuzl/p/7699818.html 1.在决策树算法中，就是根据信息论的方法找到最合适的特征来划分数据集。在这里，我们首先要计算所有类别的所有可能值的香农熵，根据香农熵来我们按照取最大信息增益（information gain）的方法划分我阅读全文

posted @ 2018-11-19 15:37 lypbendlf 阅读(647) 评论(0) 推荐(0)

全概率+贝叶斯[转载]

摘要：转自:https://www.cnblogs.com/ohshit/p/5629581.html （1）条件概率公式设A,B是两个事件，且P(B)>0,则在事件B发生的条件下，事件A发生的条件概率（conditional probability)为： P(A|B)=P(AB)/P(B) （2）乘法阅读全文

posted @ 2018-11-19 14:21 lypbendlf 阅读(280) 评论(0) 推荐(0)

2018年11月18日

PAT 1100 Mars Numbers[难]

摘要： 1100 Mars Numbers （20 分） People on Mars count their numbers with base 13: Zero on Earth is called "tret" on Mars. The numbers 1 to 12 on Earch is call 阅读全文

posted @ 2018-11-18 16:55 lypbendlf 阅读(147) 评论(0) 推荐(0)

PAT 1075 PAT Judge[比较]

摘要： The ranklist of PAT is generated from the status list, which shows the scores of the submissions. This time you are supposed to generate the ranklist 阅读全文

posted @ 2018-11-18 15:33 lypbendlf 阅读(209) 评论(0) 推荐(0)

PAT 1083 List Grades[简单]

摘要： Given a list of N student records with name, ID and grade. You are supposed to sort the records with respect to the grade in non-increasing order, and 阅读全文

posted @ 2018-11-18 11:58 lypbendlf 阅读(107) 评论(0) 推荐(0)

2018年11月17日

PAT 1082 Read Number in Chinese[难]

摘要： Given an integer with no more than 9 digits, you are supposed to read it in the traditional Chinese way. Output Fu first if it is negative. For exampl 阅读全文

posted @ 2018-11-17 15:53 lypbendlf 阅读(135) 评论(0) 推荐(0)

PAT 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 properties: (1) Every node is either 阅读全文

posted @ 2018-11-17 11:05 lypbendlf 阅读(273) 评论(0) 推荐(0)

公告