2016年10月_MyLinChi

12月 11月 10月 09月 08月 07月

原创浅谈c语言预处理知识

预处理是C语言的一个重要功能，由预处理程序负责完成。合理地使用这些预处理功能，将有利于程序的阅读、修改、调试和移植，也有利于程序的模块化设计。c语言中提供的预处理功能包括宏定义、文件包含以及条件编译等。1.宏定义①不带参数的宏定义：#define 宏名字符串（比如：#define PI 3.14159）注：宏名一般使用大写字母，以便在程序中查找宏替换的位置。②带参数的宏定

2016-10-31 20:47:50 2742 2

原创【stm32学习笔记之一】跑马灯实验（基于库函数）

1.GPIO的基本知识4种输入模式：输入浮空、输入上拉、输入下拉、模拟输入。4种输出模式：开漏输出(上拉或者下拉）、开漏复用功能(上拉或者下拉）、推挽式输出(上拉或者下拉）、推挽式复用功能(上拉或者下拉）2.库函数头文件：stm32f4xx_gpio.h 源文件：stm32f4xx_gpio.c1个初始化函数：void GPIO_Init(GPIO_TypeDef

2016-10-28 21:25:38 5733 2

原创【c语言问题系列教程之四】指针

1.*p++自增p还是p所指向的变量？由c语言表达式运算顺序知，*运算和++或者--运算是处于同一优先级的，所以看运算的结合方向。而该优先级的运算符的结合方向是从右向左结合的，所以是先自增p。2.c语言中的指针算术总是自动的采纳它所指向的对象的大小，所以遍历数组时直接加数量即可，不须要考虑数据类型的大小。所以，我们就不能对void*指针进行算术运算，因为编译器不知道所指对象的大小。

2016-10-26 23:27:56 516

原创 c语言中表达式的运算顺序

c语言中表达式的运算顺序由优先级和结合性决定。1.先按运算符优先级运算。2.如果相邻若干个运算符优先级相同，则按结合方向来运算。比如：1+2-3*4的运算为：有优先级先做*运算，3*4得到12；表达式为1+2-12，算数运算符为从左到右的结合方向，即先做+运算，再做-运算。下面是c语言运算符的优先级和结合性：优先级运算符名称或含义

2016-10-25 20:31:36 36717 5

原创【c语言问题系列教程之三】表达式

1.&&和||中的短路原则。当左边的表达式已经确定了整个表达式的结果，那个右边的表达式不会被执行，即如下程序片段输出及执行结果为： int a=0,b=1; if(1||a++); if(0&&b++); printf("a=%d\nb=%d\n",a,b);

2016-10-25 19:33:49 520

原创 c语言中数据类型的自动转换原则

由低级向高级转换的原则最近几天参加一公司招聘，其中有一道笔试题是这样的：如下程序的输出结果是？#includeint main(){ unsigned int a=6; int b=-20; (a+b>6)?printf(">6"):printf("<=6"); system("pause"); return 0;}正确答案是：至于原因就是上面所将的规

2016-10-12 22:18:25 6441

原创 c语言中的复杂声明理解方法

从内到外的原则。demo1：“const char *p”、"char const *p"和"char * const p"的区别？1.const char *p：由*知道p为指针，再外层由char知道p为指向char的指针，最后一层const知道指针p所指向的char型的变量为只读的（不能改变它所指向的字符的值）。2.char const *p：由*知道p为指针，再外层const知道

2016-10-12 20:32:55 787

Most natural optimization problems, including those arising in important application areas, are NP-hard. Therefore, under the widely believed conjecture that P -=/= NP, their exact solution is prohibitively time consuming. Charting the landscape of approximability of these problems, via polynomial time algorithms, therefore becomes a compelling subject of scientific inquiry in computer science and mathematics. This book presents the theory of approximation algorithms as it stands today. It is reasonable to expect the picture to change with time. This book is divided into three parts. In Part I we cover combinatorial algorithms for a number of important problems, using a wide variety of algorithm design techniques. The latter may give Part I a non-cohesive appearance. However, this is to be expected - nature is very rich, and we cannot expect a few tricks to help solve the diverse collection of NP-hard problems. Indeed, in this part, we have purposely refrained from tightly categorizing algorithmic techniques so as not to trivialize matters. Instead, we have attempted to capture, as accurately as possible, the individual character of each problem, and point out connections between problems and algorithms for solving them. In Part II, we present linear programming based algorithms. These are categorized under two fundamental techniques: rounding and the primaldual schema. But once again, the exact approximation guarantee obtainable depends on the specific LP-relaxation used, and there is no fixed recipe for discovering good relaxations, just as there is no fixed recipe for proving a theorem in mathematics (readers familiar with complexity theory will recognize this as the philosophical point behind the P -=/= NP question).

2020-04-26