(Coderbyte) Third Greatest - Solução

Have the function ThirdGreatest(strArr) take the array of strings stored in strArr and return the third largest word within in. So for example: if strArr is ["hello", "world", "before", "all"] your output should be world because "before" is 6 letters long, and "hello" and "world" are both 5, but the output should be world because it appeared as the last 5 letter word in the array. If strArr was ["hello", "world", "after", "all"] the output should be after because the first three words are all 5 letters long, so return the last one. The array will have at least three strings and each string will only contain letters. 

Solução:

import java.util.*;
import java.io.*;

class Function { 
  String ThirdGreatest(String[] strArr) {
    int[] contaCaracteres = new int[strArr.length];
   
    for (int i = 0; i < strArr.length; i++) {
     contaCaracteres[i] = strArr[i].length();
    }
   
    boolean achouMenor;
   
    int maior = -1;
    int indice = -1;
    for (int i = 0; i < strArr.length; i++) {
      if (contaCaracteres[i] > maior) {
        maior = contaCaracteres[i];
        indice = i;
      }
    }
   
    int maior2 = -1;
    int indice2 = -1;
    for (int i = 0; i < strArr.length; i++) {
      if (contaCaracteres[i] > maior2 && contaCaracteres[i] <= maior && i != indice) {
        maior2 = contaCaracteres[i];
        indice2 = i;
      }
    }
   
    int maior3 = -1;
    int indice3 = -1;
    for (int i = 0; i < strArr.length; i++) {
      if (contaCaracteres[i] > maior3 && contaCaracteres[i] <= maior2 && i != indice && i != indice2) {
        maior3 = contaCaracteres[i];
        indice3 = i;
      }
    }
      
    return strArr[indice3];
   
  }
 
  public static void main (String[] args) { 
    // keep this function call here    
    Scanner  s = new Scanner(System.in);
    Function c = new Function();
    System.out.print(c.ThirdGreatest(s.nextLine()));
  }  
 
}
 

Comments

Popular posts from this blog

(Coderbyte) Powers of Two - Solução

(Coderbyte) Dash Insert II - Solução

(CoderByte) Number Search - Solução