获取字符串的N段子串

例如输入:

0 3  5  7 -1

input:0123456789

output:0123567

程序分析:

输入两段字串间隔如:(0 3) (5 7) -1是结束符



/*
** 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';
}


  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 打赏
    打赏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包

打赏作者

刘华世(Moments)

你的鼓励将是我创作的最大动力

¥1 ¥2 ¥4 ¥6 ¥10 ¥20
扫码支付:¥1
获取中
扫码支付

您的余额不足,请更换扫码支付或充值

打赏作者

实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值