登录
首页 » Java » 吴小华---接口说明文档

吴小华---接口说明文档

于 2020-06-17 发布
0 304
下载积分: 1 下载次数: 3

代码说明:

说明:  接口规范,前端主要js,后端java、php、python等语言(nterface specification, front-end main js, back-end java, php, Python and other languages)

文件列表:

吴小华---接口说明文档.docx, 20585 , 2019-07-25

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

发表评论

0 个回复

  • vb
    说明:  vb编程的八大好习惯。从事vb编程的同仁们的参考之作,对于初学者有极大帮组。(vb programming eight good habit. Engaged in Tongren vb programming for their reference, have a great help for the beginners group.)
    2008-03-06 22:23:43下载
    积分:1
  • 华侨大学XFX函数优化平台2017版
    该2017版软件集成了竞赛争冠系列算法(含单目标寻优、多峰函数寻优、参数估计(拟合)等)和多种差分向量型式的差分进化算法。可对数学函数进行有或无约束优化、多峰函数优化等工作。其中改进竞赛争冠算法是近期本人的研究佳作。与现行优良的进化算法相比,颇具竞争力。(The 2017 version of the software integrates the series of race champion algorithm (including single objective optimization, multi-modal function optimization, parameter estimation (fitting) etc.) and the various types of differential evolution algorithm.It could be optimized that the single objective function with unconstrained or constrained condition or multi peak function. Especially, the improved race champion algorithm is my Good research results. Compared with the existing evolutionary algorithm is quite competitive)
    2017-11-21 21:25:00下载
    积分:1
  • software-dedigning-doc
    软件开发所需文档模版,包括前期需求,概要设计说明书,详细设计说明数,测试指南等(software dedigning doc)
    2012-05-17 21:31:48下载
    积分:1
  • 5
    1、 创建图类,存储结构使用邻接矩阵。 2、 输入图的节点数n(不超过10个)、边数m,节点分别用1-n代表。 3、 采用“起始节点,终止节点,权值”输入图的m条边,创建图。 4、 输出从节点1开始的BFS遍历,在遍历过程中,如有多个可以选择的节点,则优先选择编号较小的节点。 5、 输出从节点1开始的DFS遍历,在遍历过程中,如有多个可以选择的节点,则优先选择编号较小的节点。 6、 输出从第1节点到第n节点最短路径的长度,如果没有路经,输出0。(1. Create graph class and use adjacency matrix in storage structure. 2. The number of nodes n (no more than 10) and edge m in the input graph are represented by 1-n, respectively. 3. Create a graph by using the m-edges of the input graph of "Starting Node, Terminating Node, Weight Value". 4. Output BFS traversal starting from node 1. In the traversal process, if there are multiple nodes to choose, the node with smaller number will be preferred. 5. Output DFS traversal starting from node 1. In the traversal process, if there are multiple nodes to choose, the node with smaller number will be preferred. 6. Output the length of the shortest path from the first node to the n node. If there is no path, output 0.)
    2019-02-19 14:49:05下载
    积分:1
  • group__pwm
    source code of drive forpwm micro
    2012-09-11 15:58:20下载
    积分:1
  • OSEK-NM-2.53
    Osek OS material 中文资料,请大家参考学习(Osek introduction, please download as reference.)
    2017-08-04 20:45:50下载
    积分:1
  • 深度学习之pytorch
    说明:  深度学习之pytorch资料,对pytorch有着系统的讲解,帮助小白轻松入门(This is an archive of pytorch,which enable rookies to learn about pytorch easily and could have the opportunities to get in touch with machine learning)
    2020-12-16 08:38:54下载
    积分:1
  • Quadcopter-Dynamics--Simulation--and-Control
    Quadcopter Dynamics, Simulation, and Control
    2020-09-07 17:38:07下载
    积分:1
  • 123
    VUEL学习重要程序,非常好的程序VUEL学习重要程序,非常好的程序VUEL学习重要程序,非常好的程序(VUEL learning important program, a very good program VUEL learn important program, a very good program VUEL learn important program, a very good program)
    2015-05-01 15:31:26下载
    积分:1
  • jiecifenxi
    主要实现变转速信号的阶次分析,可以实现变转速信号角域重采样(It mainly realizes the order analysis of variable speed signal and can realize the Angle domain resampling of variable speed signal)
    2019-05-06 14:38:30下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载