Questão de Tecnologia da Informação

ĐůĂƐƐĞCountOccurrence ĞƐĐƌŝƚĂŶĂůŝŶŐƵĂŐĞŵ :ĂǀĂ͕ ƚĞŵ ƉŽƌ ŽďũĞƟǀŽ ůŽĐĂůŝnjĂƌ Ğ ĐŽŶƚĂƌ ƋƵĂŶƚĂƐ ŽĐŽƌƌġŶĐŝĂƐ ĚĞ Ƶŵ ĚĞƚĞƌŵŝŶĂĚŽ ǀĂůŽƌ ĞdžŝƐƚĞŵ Ğŵ ƵŵĐŽŶũƵŶƚŽƉƌĞĚĞƚĞƌŵŝŶĂĚŽĚĞǀĂůŽƌĞƐ͕ƌĞƚŽƌŶĂŶĚŽ ĂƋƵĂŶƟĚĂĚĞĚĞǀĞnjĞƐƋƵĞƵŵĚĞƚĞƌŵŝŶĂĚŽǀĂůŽƌƐĞ ƌĞƉĞƚĞŶŽĐŽŶũƵŶƚŽ͘ 1 public class CountConcurrence { 2 3 public boolean hasValue(int searchValue, int[] array, int i) { 4 if (i >= array.length) 5 return false; 6 7 if (array[i] == searchValue) 8 return true; 9 else 10 return hasValue(searchValue, array, i + 1); 11 } 12 13 public int count(int countValue, int[] array, int i) { 14 if (!hasValue(countValue, array, i) || i >= array.length) 15 return 0; 16 17 int c = 0; 18 if (array[i] == contValue) 19 c++; 20 21 c += count(countValue, array, i); 22 return c; 23 } 24 25 public static void main(String[] args) { 26 int[] array = {2, 3, 5, 6, 9, 7, 8, 8, 9}; 27 CountOccurrence co = new CountOccurrence(); 28 System.out.println(co.count(5, array, 0)); 29 } 30 } WĂƌĂ ƋƵĞ Ž ĂůŐŽƌŝƚŵŽ ĨƵŶĐŝŽŶĞ ĐŽƌƌĞƚĂŵĞŶƚĞ͕ ĂƚĞŶĚĞŶĚŽŽƌĞƋƵŝƐŝƚŽƉƌŽƉŽƐƚŽ͕ĂŵƵĚĂŶĕĂĞŵƐƵĂ ĞƐƚƌƵƚƵƌĂƋƵĞĚĞǀĞƐĞƌĂƉůŝĐĂĚĂĠ