字符转换的题目

今天在看c++程序设计书的时候发现这个题目的,把相应字符进行转化,规律如下:

A -> Z    a -> z

B -> Y    b -> y

..........

 

详细的代码如下:

 

#include<iostream>
using namespace std;

int main()
{
    int i = 0;
    int k = 0;
    int j = 0;
    char sEnglish[26] = { 'a','b','c','d','e','f','g','h','i','j','k','l','m','n','o','p','q','r','s','t','u','v','w','x','y','z'};
    char sChange[10] = {'b','A','z','l','m','r','s','w','t','o'};
    for ( k = 0;k < 10;k++)
    {
        if ( ( sChange[k] >= 'A' ) && ( sChange[k] <= 'Z' ) )
        {
            for ( i = 0; i < 26;i++ )
            {
                if ( sChange[k] == ( sEnglish[i] - 32 ) )
                {
                    j = i;
                    sChange[k] = ( sEnglish[ 26 -j -1 ] - 32 );
                    cout<<sChange[k]<<endl;
                    
                }
                break ;
            }
            
        }
        
        if ( ( sChange[k] >= 'a' ) && ( sChange[k] <= 'z' ) )
        {
            for ( i = 0; i < 26;i++ )
            {
                if ( sChange[k] == sEnglish[i] )
                {
                    j = i;
                    sChange[k] = sEnglish[ 26 -j -1 ];
                    cout<<sChange[k]<<endl;
                    break;
                }                
            }
        }
    } 

 return 0;
}


代码不是很优化,希望的大家给出指点.