给定N个非负整数a1，a2，。。。。a，其中每个表示坐标（i，ai）处的点。绘制N条垂直线，使得线i的两个端点位于（i，ai）和（i，0）。找到两条线，它们与x轴一起形成一个容器，使其包含最多的水。
Given N non-negative integers a1,a2,....an where each represents a point at coordinate (i, ai). N vertical lines are drawn such that the two endpoints of line i is at (i, ai) and (i,0). Find two lines, which together with x-axis forms a container, such that it contains the most water. (2024-04-09, Python, 0KB, 下载0次)
代码部分参考了大佬的可视化调度器[https: github.com AkatsukiCC huawei2019-with- visualization,没有加调度器,用融合了地杰斯特拉的贪婪思想的A- star算法计算出来最短路径,然后将车辆按照路径长短和车辆速度两个维度进行...](https: github.com AkatsukiCC huawei2019-with- visualization%EF%BC%8C%E6%B2%A1%E6%9C%89%E5%8A%A0%E8%B0%83%E5%BA%A6%E5%99%A8%EF%BC%8C%E7%94%A8%E8%9E%8D%E5%90%88%E4%BA%86%E5%9C%B0%E6%9D%B0%E6%96%AF%E7%89%B9%E6%8B%89%E7%9A%84%E8%B4%AA%E5%A9%AA%E6%80%9D%E6%83%B3%E7%9A%84A-star%E7%AE%97%E6%B3%95%E8%AE%A1%E7%AE%97%E5%87%BA%E6%9D%A5%E6%9C%80%E7%9F%AD%E8%B7%AF%E5
The code part refers to the visual scheduler of Big Brother [https: github.com AkatsukiCC huawei2019 with - visualization, without adding a scheduler, the shortest path is calculated using the A-star algorithm that integrates Dijestra s greedy idea, and then the vehicle is carried out according to the two dimensions of path length and vehicle speed...] (https: github.com AkatsukiCC huawei2019 with - visualization% EF% BC% 8C% E6% B2% A1% E6% 9C% 89% E5% 8A% A0% E8% B0% 83% E5% BA% A6% E5% 99% A8% EF% BC% 8C% E7% 94% A8% E8% 9E% 8D% E5% 90% 88% E4% BA% 86% E5% 9C% B0% E6% 9D% B0% E6% 96% AF% E7% 89% B9% E6% 8B% 89% E7% 9A% 84% E8% B4% AA% E5% A9% AA% E6% 80% 9D% E6% 83% B3% E7% 9A% 84A star% E7% AE% 97% E6% B3% 95% E8% AE% A1% E7% AE% 97% E5% 87% BA% E6% 9D% A5% E6% 9C% 80% E7% 9F% AD% E8% B7% AF% E5 (2019-12-07, Python, 0KB, 下载0次)
随机密钥生成-ADC-Arty-A7，，
Random-Key-Generation-ADC-Arty-A7,, (2023-08-06, Python, 0KB, 下载0次)
与SLAM_V_2.2_snapshot_a1兼容，
compatible with SLAM_V_2.2_snapshot_a1, (2020-06-04, Python, 0KB, 下载0次)
死亡知识库enth lt meine L sungen zu den Aufgaben A1-Müllabfuhr und A3 Hex Max der 2。Runde des Bundesinformatikwettbewerbs 2022年。
Dieses Repository enth lt meine L sungen zu den Aufgaben A1-Müllabfuhr und A3-Hex-Max der 2. Runde des Bundesinformatikwettbewerbs 2022. (2022-05-12, Python, 0KB, 下载0次)
Dieses Repository enth lt meine L sungen für die Aufgaben J1、J2和A1 für Runde 1 des 40。Bundeswettbewerbs für Informatik。
Dieses Repository enth lt meine L sungen für die Aufgaben J1, J2 und A1 für Runde 1 des 40. Bundeswettbewerbs für Informatik. (2022-05-12, Python, 0KB, 下载0次)
出于学习目的，使用朴素贝叶斯分类器预测乳腺癌的准确率为97.51%。
Predicting breast cancer at 97.51% accuracy with Naive Bayes Classifier for learning purposes. (2010-05-01, Python, 6KB, 下载0次)
一个python程序，绘制简单的python曲线
A python program, draw a simple python curve (2012-07-12, Python, 1KB, 下载9次)