-
对java中Streams的介绍,比较全面到位!
对java中Streams的介绍,比较全面到位!-right java Streams of China, the more comprehensive the point!
- 2022-02-13 21:13:29下载
- 积分:1
-
HX108
HX108-2七段数码管超外差式收音机原理分析与组装过程-HX108-2 seven-segment digital tube superheterodyne radio principles of analysis and assembly process
- 2023-07-15 00:15:03下载
- 积分:1
-
445代码 能检测445端口,使你容易发现电脑有没有445
445代码 能检测445端口,使你容易发现电脑有没有445-445 code,check the 445,find computer if have 445
- 2022-11-02 16:40:03下载
- 积分:1
-
ds.asm
ds.asm-- ----- --- -倒计时器源程序-ds.asm-------------- countdown device source
- 2023-05-08 15:25:03下载
- 积分:1
-
A) 实现虚拟存储B) 实现对文件的按名存取C) 实现对文件的按内容存取D) 实现对文件的 高速输入输出(17) 分页显示当前文件 ... A) 执行SPLIB...
A) 实现虚拟存储B) 实现对文件的按名存取C) 实现对文件的按内容存取D) 实现对文件的 高速输入输出(17) 分页显示当前文件 ... A) 执行SPLIB B) 执行SPDOS C) 装载拼音模块D) 装载五笔字型输入模块(32) 在汉字输入状态下,按下Shift+a组合键后,输入了__。-A) Virtual Storage B) the realization of the documents were accessed by C) achieved by the paper"s content access D) to achieve high-speed document input and output (17) displaying the current document ... A) The Executive SPLIB B) implementation SPDOS C) loading fight audio Module D) loading WBZX module (32) in the state of inputting Chinese characters by pressing a combination of keys Shift, the importation of __.
- 2022-02-02 13:15:50下载
- 积分:1
-
timing charateristics of netlist in verilog
timing charateristics of netlist in verilog
- 2022-08-15 18:53:32下载
- 积分:1
-
明华智能卡的上位机程序,可以给研发智能卡的用户带来方便...
明华智能卡的上位机程序,可以给研发智能卡的用户带来方便-Minghua smart card PC procedures to be developed smart card is convenient for users
- 2023-08-07 09:25:04下载
- 积分:1
-
equally wonderful, not to miss
同样很精彩,不要错过-equally wonderful, not to miss
- 2022-02-04 04:36:09下载
- 积分:1
-
9/7提升小波的代码,用matlab写的,欢迎大家交流!
9/7提升小波的代码,用matlab写的,欢迎大家交流!-9/7 lifting wavelet code, written with matlab, welcomed the exchange of everyone!
- 2022-03-10 08:55:47下载
- 积分:1
-
本算法使用分治法求解最近点对问题。事先用O(nlogn)时间对x坐标进行排序,使得所有的点是按x坐标从小到大排好序的(x坐标相同时y坐标小的排前),然后取下标小...
本算法使用分治法求解最近点对问题。事先用O(nlogn)时间对x坐标进行排序,使得所有的点是按x坐标从小到大排好序的(x坐标相同时y坐标小的排前),然后取下标小于n/2属于左边的点集PL,取下标大于n/2属于右边的点集PR,即用O(1)时间就可以将规模为n的问题分解为两个规模为n/2的、同类型的子问题。分割完毕之后就可以采用分治法,分别求出PL和PR中的最近点对,最终通过递归实现。-This algorithm uses divide and conquer to solve the problem closest point. Prior to use O (nlogn) time to sort the x coordinate so that all points are based on x coordinates from small to large sorted (x coordinates with the same y coordinates of the small, the top), and then remove the standard is less than n/2 the set of points belonging to the left PL, remove the standard is greater than n/2 set of points belonging to the right of PR, that is to use O (1) time can be the problem size n divided into two size n/2, the same type The sub-problems. Segmentation can be used after completion of sub-rule method, respectively, find the PL and PR in the last points and eventually through the recursion.
- 2022-01-25 16:01:13下载
- 积分:1