登录
首页 » C# » 有一个新发明的设计模式,很值得一看啊!大家看看!值得一看的!...

有一个新发明的设计模式,很值得一看啊!大家看看!值得一看的!...

于 2022-01-31 发布 文件大小:492.81 kB
0 94
下载积分: 2 下载次数: 1

代码说明:

有一个新发明的设计模式,很值得一看啊!大家看看!值得一看的!-have invented a new design model is an eye-catcher ah! You see! Visit the gallery!

下载说明:请别用迅雷下载,失败请重下,重下不扣分!

发表评论

0 个回复

  • wanianli
    万年历的功能 实现多种功能 希望大家喜欢(Calendar features a variety of functions hope you like)
    2011-06-21 22:38:26下载
    积分:1
  • uCOS-ii+VS 2017
    UCOSII在VS2017上的移植,亲测可以用(UCOS II Portable For Visual Studio 2017)
    2020-06-23 11:20:01下载
    积分:1
  • 12f508
    pic12f508 visual led
    2020-06-20 03:00:01下载
    积分:1
  • 高质量程序设计指南第3版
    说明:  高质量程序设计指南第3版,很好的c语言进阶教材,林锐博士著作(High Quality Programming Guide 3rd Edition, Good Advanced Textbook for C Language, Written by Dr. Lin Rui)
    2019-02-14 09:43:54下载
    积分:1
  • 聊天工具
    c#编写的局域网视频会议软件,实现了音频通讯和视频通讯
    2022-07-14 16:44:56下载
    积分:1
  • lab07
    本例主要设计查找的有关算法,例如有序表的查找和顺序标的查找,顺序查找、折半查找及二叉排序树上查找的基本思想和算法实现等。(In this case mainly designed to find the relevant algorithm, such as an ordered list of the find and order the subject to find, sequential search, binary search and binary sort tree to find the basic idea and algorithm.)
    2013-05-12 22:01:58下载
    积分:1
  • 矩阵键盘(扫描法)
    实现AVR单片机的矩阵键盘的扫描法的C源代码(AVR MCU matrix keyboard scanning method of C source code)
    2018-07-31 19:47:53下载
    积分:1
  • brainfck
    brainf×ck的一种解释器。Brainf*ck,是一种极小化的计算机语言,它是由Urban Müller在1993年创建的。由于fuck在英语中是脏话,这种语言有时被称为brainf*ck或brainf***,甚至被简称为BF。 (brainf × ck an interpreter. Brainf* ck, is a minimization of the computer language, it is by Urban Müller in 1993 created. As the fuck is the bad language in English, this language is sometimes referred to as brainf* ck or brainf***, has even been referred to as BF.)
    2008-05-12 09:57:57下载
    积分:1
  • Prim
    编程实现Prim算法,基于最小堆数据结构,生成最小代价生成树。 (其中随机生成点和边,形成连通图) 根据输入的顶点数的不同,分析时间复杂度。(Implement Prim’s algorithms based on min-heap and disjoint set data structure for constructing a minimum cost spanning tree. Generate weighted undirected complete graph for given size n according to the following approach: 1) Randomly generate n points ( ) on a plane 2) Randomly generate k pairs of points as edges of the graph. 3) The weight of an edge of the graph is defined as the the Euclidean distance between two endpoints of the edge. )
    2011-06-11 16:28:53下载
    积分:1
  • CDBN-master
    实现了卷积受限玻尔兹曼机(深度学习的一个重要算法),包括C++和matlab版本(Restricted Boltzmann realized convolution machine (depth study of an important algorithm), including C++ and matlab version)
    2014-10-23 22:01:54下载
    积分:1
  • 696516资源总数
  • 106442会员总数
  • 11今日下载