![](https://img-blog.csdnimg.cn/20201014180756919.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
算法
算法好难啊啊啊啊啊
这个作者很懒,什么都没留下…
展开
-
第三次算法作业
#include <ctime>#include "stdio.h"#include "stdlib.h"#define n 12int map[100];int book[100];int m=你的学号后两位%3+3;bool Las(int count);bool judge(int k);bool solve(int row);int main(){ while(!Las(m)); if(solve(m)) { for(.原创 2021-06-21 17:15:53 · 120 阅读 · 0 评论 -
Prim算法(Java实现)
package Leetcode;public class Prim { static int[][] map= { {999,5,6,4,999,999}, {5,999,1,2,999,999}, {6,1,999,2,5,3}, {4,2,2,999,999,4}, {999,999,5,999,999,4}, {999,999,3,4,4,99原创 2021-06-17 21:38:02 · 115 阅读 · 0 评论