Need help with Ceasar Cipher question

[Gigi]

here's the original question
ecoo.org/ecoocs/boardwide/brd2004p2.html

basically the program needs to read paragraphs from the file
(which are encrypted with ceasar cipher algorithm), and when it sees (***) it has to stop and promote a user to enter any key to continue the decrypting. I only gotten to the point where the user enters his own string which then is being decrypted and the decrypted word is displayed( and even this gives me an error).
Can please anybody with some advanced java knowledge figure this out ? any help will be appreciated.

and btw, here's what I did so far

import java.util.Scanner;


public class Problem2CeasarCipher
{
    public static void main(String[] args) 
    {
    Scanner input = new Scanner(System.in); 
     char[] wordLetters;
     int[] letterCounts = new int[26];
     int arrayIndex;
     int offset;
     int tempIndex = 0;
     int tempHighest = 0;
     System.out.println("Enter a sentence: ");
     String sentence = input.nextLine();
     String copySentence = sentence;
     sentence = sentence.replaceAll(" ", "");
     
     wordLetters = sentence.toCharArray();
     
     for(int letter = 0; letter < wordLetters.length; letter++)
     {
        offset = wordLetters[letter] - 65;
        letterCounts[offset] +=1;
     }
     
     for(int i = 0; i <= 25; i++)
     {
       if (letterCounts[i] > tempHighest)
       { 
         tempHighest = letterCounts[i];
         tempIndex = i;
       }
     } 
      
     testProblem2CeasarCipher encoding = new testProblem2CeasarCipher(tempIndex);
     encoding.decode(copySentence);
     
     System.out.println(encoding.decode());
   
       
    }    
}

/////////////


public class testProblem2CeasarCipher
{
   int e = 4;
   int shift;
   int move;
   
  public testProblem2CeasarCipher(int mostFrequent)  //costructor with an array parameter
  {
    shift = mostFrequent - e;
    move = 26 - shift;
  }
    
public String decode(String word) 
 {
    StringBuffer result = new StringBuffer();
    for (int k = 0; k < word.length(); k++)
     {
      char ch = word.charAt(k); 
      ch = (char)('A' + (ch - 'A' + move) % 26);
      result.append(ch); 
     }
    return result.toString();
  }
 
}

[Eranga]

You want to know how to decryption work on with Java?

[Gigi]

never mind, check my another thread in this forum, I already working on it

[Eranga]

Please don't ask the same question in different sub-forums, sick on one.