| 每个阶段只有一个状态->递推； | |
| 每个阶段的最优状态都是由上一个阶段的最优状态得到的->贪心； | |
| 每个阶段的最优状态是由之前所有阶段的状态的组合得到的->搜索； | |
| 每个阶段的最优状态可以从之前某个阶段的某个或某些状态直接得到而不管之前这个状态是如何得到的->动态规划。 |
To ensure that the names declared in that portion of code have C linkage, and thus C++ name mangling is not performed
#ifdef __cplusplus
extern "C" {
#endif
void *memset (void *, int, size_t);
char *strcat (char *, const char *);
int strcmp (const char *, const char *);
char *strcpy (char *, const char *);
void F(int); // 1: declaration of F(int)
void F(const int); // 2: re-declaration of F(int)
void F(int) { /* ... */ } // 3: definition of F(int)
void F(const int) { /* ... */ } // 4: error: re-definition of F(int)void F(const int* x); // 1
void F(const int& x); // 2
| (* move n discs from a to z (using third peg named x) *) | |
| let rec hanoi move n a z x = if n = 0 then () else | |
| (hanoi move (n-1) a x z ; move n a z ; hanoi move (n-1) x z a) | |
| let printmove disc a b = print_endline | |
| ("Move disc " ^ (string_of_int disc) ^ " from " ^ a ^ " to " ^ b) ;; | |
| hanoi printmove 4 "peg A" "peg C" "peg B" |
typedef struct X {
int x;
} X;
struct S {
int x;
};
typedef struct S S;
Server
strace -r -e trace=bind,listen,accept,poll,read,write nc -l -p 8080 Client
strace -r -e trace=connect,poll,read,write,close nc 127.0.0.1 8080