작은숲:위키노트/C 언어 예제/문자열 뒤집기 2

/**
 * Copyright (c) 2001,2002 Yoon, Hyunho <hhyoon@kldp.org>
 * http://mooo.org
 * ----------------------------------------------------------------------
 *
 * LICENSE
 *
 * This program is free software; you can redistribute it and/or
 * modify it under the terms of the GNU General Public License
 * as published by the Free Software Foundation; either version 2
 * of the License, or (at your option) any later version.
 *
 * This program is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 * GNU General Public License for more details.
 *
 * You should have received a copy of the GNU General Public License
 * along with this program; if not, write to the Free Software 
 * Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
 */
#include <stdio.h>
#define MAX        81
char *reverse(char *rev, const char *str);
int main()
{    char str[MAX];
    char rev[MAX];
    printf("Enter a string: ");
    gets(str);
    reverse(rev, str);
    printf("Original: %s\n", str);
    printf("Reverse: %s\n", rev);
    return 0;
}char *reverse(char rev, const char *str)
{    int i, len;
   // 문자열의 길이를 구한다.
    for (len = 0; str[i] != '\0'; len++) ;
   // 문자열을 뒤집는다.
    for (i = 0; i < len; i++)
        rev[len - i - 1] = str[i];
   // 문자열 끝에 널문자를 집어넣는다.
    rev[le= 0;
    return (rev);
}

이 작은숲 문서의 출처는 위키노트의 위키노트/C 언어 예제/문자열 뒤집기 2 문서입니다.