Advertisement
Guest User

Untitled

a guest
Jan 19th, 2018
75
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 1.31 KB | None | 0 0
  1. public class ÖvnV1ö3 {
  2. public static void main(String[] args) {
  3.  
  4. String str1 = "Erik";
  5. String str2 = "MoaSchaffer";
  6. System.out.println(stringMerger(str1, str2));
  7. System.out.println(recursiveMerger(str1,str2));
  8. }
  9.  
  10.  
  11. private static String shortestString(String str1, String str2){
  12.  
  13. if(str1.length() < str2.length()){
  14. return str1;
  15. }else{
  16. return str2;
  17. }
  18. }
  19.  
  20. private static String stringMerger(String str1, String str2){
  21.  
  22. StringBuilder sb = new StringBuilder();
  23.  
  24. String shortestString = shortestString(str1, str2);
  25. String longestString = str1.length() < str2.length() ? str2 : str1;
  26.  
  27. for (int i = 0; i < shortestString.length(); i++) {
  28. sb.append(str1.charAt(i));
  29. sb.append(str2.charAt(i));
  30. }
  31.  
  32. sb.append(longestString.substring(shortestString.length()));
  33. return sb.toString();
  34. }
  35.  
  36. private static String recursiveMerger(String str1, String str2){
  37.  
  38. if(str1.length()==0){
  39. return str2;
  40. }else if(str2.length()==0){
  41. return str1;
  42. }else{
  43. return "" + str1.charAt(0) + str2.charAt(0) + recursiveMerger(str1.substring(1),str2.substring(1));
  44. }
  45. }
  46. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement