1151810101-王德雅-实验三

通讯录的实现 基本功能实现，简单易懂 任意下载，共同进步 (Contacts to achieve the realization of the basic functions, easy to download arbitrary, and common progress)

全志硬件编解码，这里面有一些例子仅供参考，我觉得还是挺好的(is very good icedarv_decoder_t* decode_init(unsigned int width, unsigned int height))

小区物业管理:管理小区的费用、小区工作人员的编排和工资管理、小区的运作、对住户资料的管理、房产资源管理、小区事务的管理、对住户的需要管理、停车场管理-Area property management: the management of district costs, district staff scheduling and payroll management, district operations, information on household management, property resource management, district management of the affairs of the household needs of management, car park management

说明：  zip内包含所有章节代码以及书籍pdf版本(Zip contains all chapter codes as well as the PDF version of the book)

隐极同步发电机和凸极同步发电机模型的PSCAD实例(PSCAD Example of Non-salient Models For Synchronous Generator)

数学建模，线性规划模型，优化问题案例，各种题型与案例(Mathematical modeling, linear programming model, optimization case, the various types of problems in case)

Used for Binary trading. It is non repaint indicators.

SDL练习：响应鼠标事件。 想学习SDL的人可以参考！ VC2008下测试通过！-SDL practice: Responding to mouse events. People who want to learn SDL can refer to! VC2008 under test!

说明：  实现对原始I/Q数据的相参积累处理，基础实用(Realizing coherent accumulation processing of radar original I / Q data)

算法实现题 最长公共子序列问题 给定两个序列 X = { x1 , x2 , ... , xm } Y = { y1 , y2 , ... , yn } 求X和Y的一个最长公共子序列 举例 X = { a , b , c , b , d , a , b } Y = { b , d , c , a , b , a } 最长公共子序列为 LSC = { b , c , b , a }-Algorithm to achieve the longest common sub-title sequence of the problem given two sequences X = (x1, x2, ..., xm) Y = (y1, y2, ..., yn) for X and Y, a maximum common substructure sequence, for example X = (a, b, c, b, d, a, b) Y = (b, d, c, a, b, a) the longest common sub-sequence for LSC = (b, c, b, a )