Comparing Each Character in Java String

Question

I am a beginner at C++, and I am trying to create two strings

any suggestion?

Perhaps you should compare the `String#substring(int, int)` instead. — Josh M, Oct 19 '13 at 01:11
Is word order important? You've shown that "super" and "perfect" result in "superfect", would "perfect" and "super" also be "superfect" or " perfectsuper"? — Ray Stojonic, Oct 19 '13 at 01:22

score 0 · Answer 1 · edited Oct 19 '13 at 03:51

0

Equals method will not help you in this situation. compare using charAt(). Use two for loop and iterate both strings then add not matching characters to one string and print it at last. ex:

 for(int i=0;i&lt;inputword.length;i++){

       for(int j=0;i&lt;inputword2.length;j++){ 

          if(inputword.chatAt(i)==inputword2.charAt(j)){
               //here write your logic or remove it from your string
          }
      }
  }

edited Oct 19 '13 at 03:51

raduns

765
7
18

answered Oct 19 '13 at 01:54

Kanagaraj M

956
8
18

For(int i=0;i – Kanagaraj M Oct 19 '13 at 02:03
I had to define by using char, but i think it would work! thank you – user2760357 Oct 19 '13 at 02:15
Code looks ok. At which line your getting exception. – Kanagaraj M Oct 19 '13 at 02:55
Run it in debugging mode and find what goes wrong and change it. – Kanagaraj M Oct 19 '13 at 03:07
I'm really a beginner in java so I have no idea about debugging.. I did try to do it with a compiler, but it doesn't work it seems to be a simple code, and do you think you could write it? – user2760357 Oct 19 '13 at 03:09
Yes, i will post it later. – Kanagaraj M Oct 19 '13 at 03:19

Bohemian · Answer 2 · 2013-10-19T21:01:27.480

To calculate how many characters at the start one word "overlap" the end of second:

public static int combinedLength(String s1, String s2) {
    s1 = s1.toLowerCase();
    s2 = s2.toLowerCase();
    for (int i = 1; i < s1.length() && i < s2.length(); i++)
        if (s1.endsWith(s2.substring(0, i+1)) || s2.endsWith(s1.substring(0, i+1)))
            return s1.length() + s2.length() - i;
    return s1.length() + s2.length();
}

This works by progressively testing longer letter sequences at the start/end if find if s1 starts with s2's end or visa versa. Because there can be only one such match, the first match found returns the result of the sum of both lengths minus the iteration number. No match returns the sum of both lengths.

Testing:

combinedLength("super", "perfect") ==> 9
combinedLength("perfect", "super") ==> 9
combinedLength("pencil", "eraser") ==> 12

Comparing Each Character in Java String

2 Answers2