共计 3724 个字符，预计需要花费 10 分钟才能阅读完成。
明天给大家分享一下一个敌人买的实战我的项目包，这个敌人呢跟大部分在座的一样，大学时就是天天打游戏泡酒吧，技术那是齐全拉垮，虽说校招前恶补了两个月理论知识，但我的项目实战经验为零啊，这就如同某些人恋爱实践一套一套的，但你要问他谈过几个女朋友，他能跟你急眼，别问，问就是处男。强调一下真的是敌人，不是我 [doge]。
这种状况下显然是找不到称心的工作的，没辙啊，我这位敌人又只能恶补我的项目实战，网上找了许久，明天跟我说这个看起来还不错，于是先花 328 买了一个小我的项目包，咱们来看看这个我的项目有哪些货色。
篇幅所限，只给大家贴出局部源码，感兴趣的敌人能够点赞评论【我的项目实战】或者进群 973961276 即可取得所有源码跟电子书哦！
我的项目实战相干的视频材料我放在这里了☞c/c++ 我的项目实战，学习办法在这里☞企业级我的项目实战，三个月疾速待业！
一、C 和指针材料
这个文件夹里次要有一本叫《C 和指针》的电子书和一些源码，其余一些系统就不表了，我在上面贴一些电子书的截图和局部源码给大家看看。
《C 和指针》☟
《C 和指针源代码及答案》☟
rearrang
/*
** This program reads input lines from the standard input and prints
** each input line, followed by just some portions of the lines, to
** the standard output.
**
** The first input is a list of column numbers, which ends with a
** negative number. The column numbers are paired and specify
** ranges of columns from the input line that are to be printed.
** For example, 0 3 10 12 -1 indicates that only columns 0 through 3
** and columns 10 through 12 will be printed.
*/
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#define MAX_COLS 20 /* max # of columns to process */
#define MAX_INPUT 1000 /* max len of input & output lines */
int read_column_numbers(int columns[], int max );
void rearrange( char *output, char const *input,
int n_columns, int const columns[]);
int
main(void)
{
int n_columns; /* # of columns to process */
int columns[MAX_COLS]; /* the columns to process */
char input[MAX_INPUT]; /* array for input line */
char output[MAX_INPUT]; /* array for output line */
/*
** Read the list of column numbers
*/
n_columns = read_column_numbers(columns, MAX_COLS);
/*
** Read, process and print the remaining lines of input.
*/
while(gets( input) != NULL ){printf( "Original input : %sn", input);
rearrange(output, input, n_columns, columns);
printf("Rearranged line: %sn", output);
}
return EXIT_SUCCESS;
}
/*
** Read the list of column numbers, ignoring any beyond the specified
** maximum.
*/
int
read_column_numbers(int columns[], int max )
{
int num = 0;
int ch;
/*
** Get the numbers, stopping at eof or when a number is < 0.
*/
while(num < max && scanf( "%d", &columns[num] ) == 1
&& columns[num] >= 0 )
num += 1;
/*
** Make sure we have an even number of inputs, as they are
** supposed to be paired.
*/
if(num % 2 != 0){puts( "Last column number is not paired.");
exit(EXIT_FAILURE);
}
/*
** Discard the rest of the line that contained the final
** number.
*/
while((ch = getchar()) != EOF && ch != 'n' )
;
return num;
}
/*
** Process a line of input by concatenating the characters from
** the indicated columns. The output line is then NUL terminated.
*/
void
rearrange( char *output, char const *input,
int n_columns, int const columns[])
{
int col; /* subscript for columns array */
int output_col; /* output column counter */
int len; /* length of input line */
len = strlen(input);
output_col = 0;
/*
** Process each pair of column numbers.
*/
for(col = 0; col < n_columns; col += 2){int nchars = columns[col + 1] - columns[col] + 1;
/*
** If the input line isn't this long or the output
** array is full, we're done.
*/
if(columns[col] >= len ||
output_col == MAX_INPUT - 1 )
break;
/*
** If there isn't room in the output array, only copy
** what will fit.
*/
if(output_col + nchars > MAX_INPUT - 1)
nchars = MAX_INPUT - output_col - 1;
/*
** Copy the relevant data.
*/
strncpy(output + output_col, input + columns[col],
nchars );
output_col += nchars;
}
output[output_col] = '0';
} s_srch1
/*
** Given a pointer to a NULL-terminated list of pointers, search
** the strings in the list for a particular character.
*/
#include <stdio.h>
#define TRUE 1
#define FALSE 0
int
find_char(char **strings, char value)
{
char *string; /* the string we're looking at */
/*
** For each string in the list ...
*/
while(( string = *strings++) != NULL ){
/*
** Look at each character in the string to see if
** it is the one we want.
*/
while(*string != '0'){if( *string++ == value)
return TRUE;
}
}
return FALSE;
} 二、WEB 外挂
这个文件夹外面同样是有《外挂制作教程》和配套的电子书。一起来看看
外挂制作教程☟
《网络游戏外挂》☟
三、Windows 程序设计
Windows 程序开发指南☟
code☟
四、数据结构
大略就是这些货色了，剩下的几个我的项目和配套电子书如果有人看的话再更新一下吧，点个赞让我晓得有人在看好吗
