Caesar Cipher java my way, doesnt work -


i know there bunch of topics caesar cipher solve things way. , such doesnt work ,but think might work way.i sure know feeling when alone solve problem.

so here idea. make array of chars consist alphabet. , string message code. 2 loops. 1 outer set char message, , inner scans thru alphabet array. when letter message meet char in array, replaces him 3rd (key of 3) char down in array.

here piece of code written now: 

    char[] alphabet = { 'a', 'b', 'c', 'd', 'e', 'f', 'g', 'h', 'i', 'j', 'k', 'l', 'm', 'o', 'p','r','s','t','u', 'v', 'z'};      string message = " message coding";      message = message.tolowercase();     string codedmsg = "";        for(int = 0; < message.length(); i++)     {          for(int j =0; j < alphabet.length; j++)         {             if(message.charat(i) == alphabet[j])             {     codedmsg += alphabet[j +3 ];

it complies well, receive following error when run :

exception in thread "main" java.lang.arrayindexoutofboundsexception: 23         @ sifra.main(sifra.java:19)

you're problem have alphabet[j + 3]. because j < alphabet.length, when j = alphabet.length - 2 alphabet[j + 3] becomes alphabet[alphabet.length + 1] go outside array.

to solve can use alphabet[(j + 3)%alphabet.length].

now code run not correct.

because manipulate message replaced many times in inner loop.

for(int j =0; j < alphabet.length; j++)         {             if(message.charat(i) == alphabet[j])             {                 message = message.replace(message.charat(i), alphabet[j + 3]); // line problem

if message.charat(i) = a true if(message.charat(i) == alphabet[j]) , a in sting change d message.charat(i) = d , after 3 iteration of for(int j =0; j < alphabet.length; j++) if statement true again , d in string replaced g , on. solution problem following there many more:

     char[] alphabet = { 'a', 'b', 'c', 'd', 'e', 'f', 'g', 'h', 'i', 'j', 'k', 'l', 'm', 'o', 'p','r','s','t','u', 'v', 'z'};          string message = " message coding";          message = message.tolowercase();         char[] messagearray = message.tochararray();          for(int = 0; < message.length(); i++)         {             for(int j =0; j < alphabet.length; j++)             {                 if(message.charat(i) == alphabet[j]){                     messagearray[i] = alphabet[(j + 3)%alphabet.length];                 }             }         }         system.out.println(string.copyvalueof(messagearray));

-

Popular posts from this blog

debugging - Reference - What does this error mean in PHP? -

what this? this number of answers warnings, errors , notices might encounter while programming php , have no clue how fix. community wiki, invited participate in adding , maintaining list. why this? questions "headers sent" or "calling member of non-object" pop on stack overflow. root cause of questions same. answers questions typically repeat them , show op line change in his/her particular case. these answers not add value site because apply op's particular code. other users having same error can not read solution out of because localized. sad, because once understood root cause, fixing error trivial. hence, list tries explain solution in general way apply. what should here? if question has been marked duplicate of this, please find error message below , apply fix code. answers contain further links investigate in case shouldn't clear general answer alone. if want contribute, please add "favorite" error message, warning or notic...
Read more

c++ - Why doesn't unordered_set provide an array access operator -

i'm curious why stl container unordered_set , has constant time complexity random access on average, not provide method accessing elements distance first element in container. example: t& unordered_set::operator[](size_t index) { return *(begin() + index); } accessing element "by distance" implies there meaningful way measure distance. trouble std::unordered_set is is, well, unordered . hence, there no meaningful way of explaining "some distance beginning" in non-arbitrary way. if want access distance, copy data vector: std::vector tmp(unordered.begin(), unordered.end());
Read more