|
|
@@ -1,13 +1,12 @@
|
|
|
1
|
+class RotationalCipher {
|
|
1
|
2
|
|
|
2
|
|
-public class RotationalCipher {
|
|
3
|
|
-
|
|
4
|
|
- int shiftKey;
|
|
|
3
|
+ private int shiftKey;
|
|
5
|
4
|
|
|
6
|
5
|
RotationalCipher(int shiftKey) {
|
|
7
|
6
|
this.shiftKey = shiftKey;
|
|
8
|
7
|
}
|
|
9
|
8
|
|
|
10
|
|
- public String rotate(String data) {
|
|
|
9
|
+ String rotate(String data) {
|
|
11
|
10
|
StringBuilder dataStringBuilder = new StringBuilder();
|
|
12
|
11
|
for (char c : data.toCharArray()) {
|
|
13
|
12
|
if (Character.isUpperCase(c)) {
|
|
|
@@ -25,12 +24,10 @@ public class RotationalCipher {
|
|
25
|
24
|
* For Uppercase CaseStart = 'A' and CaseEnd = 'Z'
|
|
26
|
25
|
* For Lowercase CaseStart = 'a' and CaseEnd = 'z'
|
|
27
|
26
|
*/
|
|
28
|
|
- private char getReplacementCharacter(char characterToReplace,
|
|
29
|
|
- char alphabetCaseStart, char alphabetCaseEnd) {
|
|
|
27
|
+ private char getReplacementCharacter(char characterToReplace, char alphabetCaseStart, char alphabetCaseEnd) {
|
|
30
|
28
|
char replacementCharacter = (char) (characterToReplace + shiftKey);
|
|
31
|
29
|
if (replacementCharacter > alphabetCaseEnd) {
|
|
32
|
|
- replacementCharacter = (char) ((alphabetCaseStart - 1) +
|
|
33
|
|
- (replacementCharacter % alphabetCaseEnd));
|
|
|
30
|
+ replacementCharacter = (char) ((alphabetCaseStart - 1) + (replacementCharacter % alphabetCaseEnd));
|
|
34
|
31
|
}
|
|
35
|
32
|
return replacementCharacter;
|
|
36
|
33
|
}
|