今天給大家分享一下一個朋友買的實戰專案包，這個朋友呢跟大部分在座的一樣，大學時就是天天打游戲泡酒吧，技術那是完全拉垮，雖說校招前惡補了兩個月理論知識，但專案實戰經驗為零啊，這就好像某些人戀愛理論一套一套的，但你要問他談過幾個女朋友，他能跟你急眼，別問，問就是處男，強調一下真的是朋友，不是我[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 : %s\n", input );
		rearrange( output, input, n_columns, columns );
		printf( "Rearranged line: %s\n", 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;
}