Caesar Cipher Encryptor

Prompt

Given a non-empty string of lowercase letters and a non-negative integer representing a
key, write a function that returns a new string obtained by shifting every letter in the input
string by k positions in the alphabet, where k is the key.

Note that letters should “wrap” around the alphabet; in other words, the letter z shifted by one returns the letter a .

Sample Input

string = 'xyz'
key = 2

Sample Output

"zab"

Solution 1

import java.util.*;

class Program {
  public static String caesarCypherEncryptor(String str, int key) {
		char[] newLetters = new char[str.length()];
		int newKey = key % 26;
		for(int i = 0; i < str.length(); i++) {
			newLetters[i] = getNewLetters(str.charAt(i), newKey);//A
		}
    return new String(newLetters);//B
  }
	public static char getNewLetters(char letter, int key) {
		int  newLetterCode = letter + key;//C
		return newLetterCode <= 122 ? (char) newLetterCode : (char) (96 + newLetterCode % 122);
	}
}

# 1A

charAt

# 1B

在这里插入图片描述

# 1C

char/int相互转化

Solution 2

import java.util.*;

class Program {
  public static String caesarCypherEncryptor(String str, int key) {
		char[] newLetters = new char[str.length()];
		int newKey = key % 26;
		String alphabet = "abcdefghijklmnopqrstuvwxyz";
		for (int i = 0; i < str.length(); i++){
			newLetters[i] = getNewLetters(str.charAt(i), newKey, alphabet);
		}
    return new String(newLetters);
  }
	
	public static char getNewLetters(char letter, int key, String alphabet) {
		int newLetterCode = alphabet.indexOf(letter) + key; //A
		return newLetterCode <= 25 ? alphabet.charAt(newLetterCode) : alphabet.charAt(newLetterCode - 26);
	}
}

# 2A

indexof(String str)

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
c语言编写,欢迎扔板砖 //移位算法 #include #include #define SIZE 50 int main() { //i 用于计数输入个数,j 为临时变量, plain 存放明文, cipher 存放密文,decryption存放解密后文本,fpp 为明文文件指针,fpc 为密文文件指针 int i,j; char plain[SIZE],cipher[SIZE],decryption[SIZE],ciphertext[SIZE]; FILE * fpp,* fpc,* fpd; //加密 //建立新的明文TXT文件 printf("Caesar algorithm\n"); if((fpp=fopen("plain.txt","w+"))==NULL) { printf("creat new plain file error!\n"); exit(0); } //输入明文 printf("input plain alphabet:\n"); i=0; scanf("%c",&plain[i]); while(plain[i]!='\n'&&i<SIZE) { i++; scanf("%c",&plain[i]); } printf("success input %d characters\n",i); //将明文转存到文件中 for(j=0;j<i;j++) { if(fwrite(&plain[j],sizeof(char),1,fpp)!=1) { printf("saving plain file error!\n"); exit(0); } } printf("success saving plain text!\n"); //加密 for(j=0;j<i;j++) { cipher[j]=plain[j]+3; if(cipher[j]99) { printf("cipher %d = %c\n",j,cipher[j]); } else if(cipher[j]>122) { cipher[j]=cipher[j]%122+96; printf("cipher %d = %c\n",j,cipher[j]); } else if(cipher[j]>90) { cipher[j]=cipher[j]%90+64; printf("cipher %d = %c\n",j,cipher[j]); } else { printf("cipher %d = %c\n",j,cipher[j]); } } //建立密文文件 if((fpc=fopen("cipher.txt","w+"))==NULL) { printf("create new cipher file error!"); exit(0); } for(j=0;j<i;j++) { if(fwrite(&cipher[j],sizeof(char),1,fpc)!=1) { printf("saving cipher file error!"); exit(0); } } printf("success saving cipher file!"); printf("\n"); //解密 printf("input ciphertext alphabet:\n"); i=0; scanf("%c",&ciphertext[i]); while(ciphertext[i]!='\n'&&i<SIZE) { i++; scanf("%c",&ciphertext[i]); } for(j=0;j<i;j++) { decryption[j]=ciphertext[j]-3; if(decryption[j]90&&decryption[j]<97) { decryption[j]=123-(97-decryption[j]); printf("character %d = %c\n",j,decryption[j]); } else {
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

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

余额充值