-
设计模式中 代理模式和工厂模式的C++实现
关于设计模式的问题在IT面试时越来越多的被问到，该源码实现了代理模式和工厂模式，其中代理模式在main函数中被注释掉了，当前运行的是工厂模式，如果想了解代理模式，将注释去掉即可。
- 2023-03-09 19:10:03下载
- 积分：1
-
billiard revised version of the game is in progress. . . Exhibitions
桌球游戏的修改版本，正在完善之中。。。多多指教-billiard revised version of the game is in progress. . . Exhibitions
- 2022-08-14 19:19:32下载
- 积分：1
-
用idl进行二项式拟合得例子,通过不同参数,可以拟合不同得二项式,还有ps与eps制图,适合初学者...
用idl进行二项式拟合得例子,通过不同参数,可以拟合不同得二项式,还有ps与eps制图,适合初学者-Idl carried out by fitting a binomial example, through the different parameters can be different from a binomial fitted, as well as ps and eps graphics, suitable for beginners
- 2022-04-11 00:02:04下载
- 积分：1
-
Based on the L297 and L298N driver circuit of the stepper motor can directly dri...
基于L297和L298N的步进电机驱动电路，可直接驱动步进电机-Based on the L297 and L298N driver circuit of the stepper motor can directly drive stepper motor
- 2022-11-01 03:15:03下载
- 积分：1
-
实现SDE图层和数据表的动态关联,时时更新
实现SDE图层和数据表的动态关联,时时更新-The achievement of SDE layers and associated data tables
- 2022-07-13 21:17:25下载
- 积分：1
-
C 语言开发环境
C 语言开发环境 -C language development environment
- 2022-12-11 20:40:04下载
- 积分：1
-
商业版可以向你的网站发送假的请求，大幅度的增加你的网站的点击率和排名
name:www.mycodes.net
sn:042392934239...
商业版可以向你的网站发送假的请求，大幅度的增加你的网站的点击率和排名
name:www.mycodes.net
sn:042392934239-Commercial version could be sent to your Web site leave request, a substantial increase in your site s click-through rate and ranking name: www.mycodes.netsn:042392934239
- 2022-10-29 03:10:03下载
- 积分：1
-
enterprises updated matrix coding
企业编码最新汇总-enterprises updated matrix coding
- 2023-03-19 20:20:03下载
- 积分：1
-
常见的排序算法，如插入排序，快速排序
常见的排序算法，如插入排序，快速排序-common algorithm, such as the insertion sort, rapid sequencing etc.
- 2023-09-01 11:30:04下载
- 积分：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
