C/C++运算符的优先级
Precedence Operator Description Example Overloadable Associativity
1
::
Scope resolution operator
Class::age = 2;
no
none
2
()
()
[]
->
.
++
--
const_cast
dynamic_cast
static_cast
reinterpret_cast
typeid
Function call
Member initalization
Array access
Member access from a pointer
Member access from an object
Post-increment
Post-decrement
Special cast
Special cast
Special cast
Special cast
Runtime type information
isdigit('1')
c_tor(int x, int y) : _x(x), _y(y*10){};
array[4] = 2;
ptr->age = 34;
obj.age = 34;
for( int i = 0; i < 10; i++ ) cout << i;
for( int i = 10; i > 0; i-- ) cout << i;
const_cast<type_to>(type_from);
dynamic_cast<type_to>(type_from);
static_cast<type_to>(type_from);
reinterpret_cast<type_to>(type_from);
cout « typeid(type).name();
yes
yes
yes
yes
no
yes
yes
no
no
no
no
no
left to right
3
!
not
~
compl
++
--
-
+
*
&
new
new []
delete
delete []
(type)
sizeof
Logical negation
Alternate spelling for !
Bitwise complement
Alternate spelling for ~
Pre-increment
Pre-decrement
Unary minus
Unary plus
Dereference
Address of
Dynamic memory allocation
Dynamic memory allocation of array
Deallocating the memory
Deallocating the memory of array
Cast to a given type
Return size of an object or type
if( !done ) …
flags = ~flags;
for( i = 0; i < 10; ++i ) cout << i;
for( i = 10; i > 0; --i ) cout << i;
int i = -1;
int i = +1;
int data = *intPtr;
int *intPtr = &data;
long *pVar = new long;
MyClass *ptr = new MyClass(args);
delete pVar;
delete [] array;
int i = (int) floatNum;\\int size = sizeof(float);
yes
yes
yes
yes
yes
yes
yes
yes
yes
yes
yes
yes
yes
no
right to left
4
->*
.*
Member pointer selector
Member object selector
ptr->*var = 24;
obj.*var = 24;
yes
no
left to right
5
*
/
%
Multiplication
Division
Modulus
int i = 2 * 4;
floa
相关文档：
#include "stdio.h"
#include "malloc.h"
typedef int elemtype;
struct node
{
elemtype data;
struct node *next;
};
typedef struct node NODE;
NODE * creat(NODE *head)
{
NODE *p,*q;
elemtype i;
head=(NODE*)malloc(sizeof(NODE));
scanf("%d",&(head->data));
p=head;
......
栈：函数调用的时候，在栈中保存局部变量和函数参数等。当函数返回时，自动清除栈。
自由存储区：也称为堆(heap)，可以看作大量的内存段。通过 new 操作符分配的内存在堆中。程序结束之前不自动清除自由存储区。需要由程序来负责释放（delete）。
1.
对指向栈上内存的指针调用delete会导致程序Crash。
2.
new 进 ......
#include "stdio.h"
#include "math.h"
#include "time.h"
#define INTERVAL 1 定义宏的时间间隔为1秒
//
void On_Time() //每一秒激发的事件
{
printf("now=%s\n","JJK");
}
void Timer() //时钟的函数
{ time_t newclk,oldclk;
while(1)
&nb ......
在Linux下写程序，遇到一个函数不知道怎么用就得上网去查，没有类似MSDN之类的软件，烦得很。看到网上很多人都说用man很方便，只要man一下你想了解的函数就行了，可我在man之后什么都得不到，比如 man printf，结果就是没有入口
今天专门上网搜了下，发现原来是因为Ubuntu默认没有装manpages-dev，而函数都在这个包里，把� ......
第二章 c语言概述
一个简单的实例
#include <stdio.h>
int main(void)
{
int num; /*定义变量num*/
num = 1; /*给变量num赋值*/
printf("I am a simple"); /*使用printf()函数*/
& ......
