public class Caesar { public static final String SOURCE = "abcdefghijklmnopqrstuvwxyz"; public static final int LEN = SOURCE.length(); /** * @param args */ public static void main(String[] args) { String result = caesarEncryption("newyork"); System.out.println("encryption result:" + result); System.out.println("decryption result:" + caesarDecryption(result)); } //Encryption public static String caesarEncryption(String s) { StringBuilder sb = new StringBuilder(); if (s == null || s.length() < 1) { System.out.println("you Input nothing."); return null; } if (!isAlp(s)) { System.out.println("input ABC... only"); return null; } s = s.toLowerCase(); int len = s.length(); for (int j = 0; j < len; j++) { char c = s.charAt(j); int a = SOURCE.indexOf(c); if (a == LEN -1) a = -1; if (a == LEN -2) a = -2; if (a == LEN - 3) a = -3; sb.append(SOURCE.charAt(a + 3)); } return sb.toString(); } //Decryption public static String caesarDecryption(String s) { StringBuilder sb = new StringBuilder(); <em>本文来源[email protected]搞@^&代*@码)网5</em> if (s == null || s.length() < 1) { System.out.println("you Input nothing."); return null; } if (!isAlp(s)) { System.out.println("input ABC... only"); return null; } s = s.toLowerCase(); for (int i = 0; i < s.length(); i++) { char c = s.charAt(i); int a = SOURCE.indexOf(c); if (a == 2) a = LEN + 2; if (a == 1) a = LEN + 1; if (a == 0) a = LEN; sb.append(SOURCE.charAt(a - 3)); } return sb.toString(); } public static boolean isAlp(String s) { String p = "^[A-Za-z]+$"; Pattern pattern = Pattern.compile(p); Matcher matcher = pattern.matcher(s); if (matcher.find()) { return true; } return false; }}
更多JAVA实现caesar凯撒加密算法相关文章请关注搞代码！
搞代码网（gaodaima.com）提供的所有资源部分来自互联网，如果有侵犯您的版权或其他权益，请说明详细缘由并提供版权或权益证明然后发送到邮箱[email protected]，我们会在看到邮件的第一时间内为您处理，或直接联系QQ：872152909。本网站采用BY-NC-SA协议进行授权
转载请注明原文链接：JAVA实现caesar凯撒加密算法
转载请注明原文链接：JAVA实现caesar凯撒加密算法
