| 123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309 |
- import java.util.*;
- import java.util.stream.Stream;
-
- public class Arraz {
-
- public int sumValuesOfArray(int[] intArr){
- int sum = 0;
- for (int i = 0; i <intArr.length ; i++) {
- sum += intArr[i];
- }
- return sum;
- }
-
- public double sumDoublesOfArray(double[] dbArr){
- double sum = 0.0;
- for (int i = 0; i < dbArr.length; i++) {
- sum += dbArr[i];
- }
- return sum;
- }
-
- public int averageOfArray(int[] intArr){
- return sumValuesOfArray(intArr) / intArr.length;
- }
-
- public double averageDoubleOfArray(double[] dbArr){
- return sumDoublesOfArray(dbArr) / dbArr.length;
- }
-
- public boolean containsValue(int[] intArr, int value){
- for (int anIntArr : intArr) {
- if (anIntArr == value) {
- return true;
- }
- }
- return false;
- }
-
- public int[] reverseArray(int[] intArr){
- int[] newArr = new int[intArr.length];
- int count = 0;
- for (int i = intArr.length-1; i >= 0; i--) {
- newArr[count] = intArr[i];
- count++;
- }
- return newArr;
- }
-
- public Integer countOdds(Integer[] intArr){
- Integer odds = 0;
- for (int i = 0; i < intArr.length; i++) {
- if (intArr[i] % 2 != 0){
- odds++;
- }
- }
- return odds;
- }
-
- public Integer countEvens(Integer[] intArr){
- Integer evens = 0;
- for (int i = 0; i < intArr.length; i++) {
- if(intArr[i] % 2 == 0){
- evens++;
- }
- }
- return evens;
- }
-
-
-
- public int countOdds(int[] intArr){
- int odds = 0;
- for (int i = 0; i < intArr.length; i++) {
- if (intArr[i] % 2 != 0){
- odds++;
- }
- }
- return odds;
- }
-
- public int countEvens(int[] intArr){
- int evens = 0;
- for (int i = 0; i < intArr.length; i++) {
- if(intArr[i] % 2 == 0){
- evens++;
- }
- }
- return evens;
- }
-
-
- public int[] getOddEvensOfArray(int[] intArr){
- int odds = countOdds(intArr);
- int evens = countEvens(intArr);
- int[] newArr = new int[]{odds, evens};
-
- return newArr;
- }
-
- public int findIndexOf(int[] intArr, int value){
- int index = 0;
- for (int i = 0; i <intArr.length ; i++) {
- if(intArr[i] == value){
- index = i;
- }
- }
- return index;
- }
-
- public Integer[] copyArrayByIterator(Integer[] intArr, Integer[] copyArr){
- Iterator<Integer> list = Arrays.asList(intArr).iterator();
- int c = 0;
- while (list.hasNext()){
- copyArr[c] = list.next();
- c++;
- }
- return copyArr;
- }
-
- public int[] copyArrayByLoop(int[] intArr, int[] copyArr){
- for (int i = 0; i <intArr.length ; i++) {
- copyArr[i] = intArr[i];
- }
- return copyArr;
- }
-
- public int[] removeElementFromArray(int[] intArr, int valueToRemove){
- int[] newArr = new int[intArr.length - 1];
- for (int i = 0; i < intArr.length - 1; i++) {
- if(intArr[i] != valueToRemove){
- newArr[i] = intArr[i];
- }
- }
- return newArr;
- }
-
- public void insertIntoArrayAt(int[] intArr,int value, int index){
- intArr[index] = value;
- }
-
- public int[] findMaxMinOfArray(int[] intArr){
- int min = 0;
- int max = 0;
-
- Arrays.sort(intArr);
- min = intArr[0];
- max = intArr[intArr.length-1];
- int[] minMax = new int[]{min, max};
- return minMax;
- }
-
-
- public Integer[] removeDupeFromArray(Integer[] arr) {
- Arrays.sort(arr);
- ArrayList<Integer> temp = new ArrayList<>();
- temp.add(arr[0]);
-
- for (int i = 1; i < arr.length; i++) {
- if(!arr[i -1].equals(arr[i])){
- temp.add(arr[i]);
- }
- }
- Integer[] newArr = new Integer[temp.size()];
- newArr = temp.toArray(new Integer[temp.size()]);
-
- return newArr;
- }
-
- public double find2ndLargestValueFromArray(double[] dbArr){
- Arrays.sort(dbArr);
- return dbArr[dbArr.length - 2];
- }
-
- public ArrayList makeMeAnArrayListFromArray(int[] intArr){
- ArrayList<Integer> list = new ArrayList<>();
-
- for (int i = 0; i < intArr.length; i++) {
- list.add(intArr[i]);
- }
-
- return list;
- }
-
- public Object[] makeMeAnArrayFromArrayList(ArrayList list){
-
- return list.stream().toArray(Integer::new);
- }
-
- public boolean check2ArraysForEqual(int[] arr1, int[]arr2){
- return Arrays.equals(arr1, arr2);
- }
-
- public int averageArrayWithoutMaxMin(int[] arr){
- int sum = 0;
- Arrays.sort(arr);
- for (int i = 1; i < arr.length - 1; i++) {
- sum += arr[i];
- }
- return sum/(arr.length-2);
- }
-
- public boolean arrayHas65and77(int[] arr){
- ArrayList<Integer> list = new ArrayList<>();
- for (int anArr : arr) {
- list.add(anArr);
- }
- return list.contains(65) && list.contains(77);
- }
-
- public boolean theTotalofTensIs30(int[] arr){
- int sumOfTens = 0;
- for (int anArr : arr) {
- if (anArr == 10) {
- sumOfTens += anArr;
- }
- }
- return sumOfTens == 30;
- }
-
- public int[] twoSmallestInArray(int[] arr){
- Arrays.sort(arr);
- return new int[]{arr[0], arr[1]};
- }
-
- public Integer[] makeMeACopyPlease(Integer[] arr){
- Integer[] newArr = new Integer[arr.length];
- Integer count = 0;
- for (int i = arr.length-1; i >= 0; i--) {
- newArr[count] = arr[i];
- count++;
- }
- return newArr;
- }
-
- public Integer[] removeLastItemAndCopy(Integer[] arr){
- Integer[] arr1 = new Integer[arr.length-1];
- for (int i = 0; i <arr.length-1; i++) {
- arr1[i] = arr[i];
- }
- return arr1;
- }
-
- public Integer[] removeFirstItemAndCopy(Integer[] arr){
- Integer[] arr1 = new Integer[arr.length-1];
- int c =0;
- for (int i = 1; i <arr.length; i++) {
- arr1[c] = arr[i];
- c++;
- }
- return arr1;
- }
-
- public Integer[] insertAtStartAndCopy(Integer[] arr, Integer number){
- Integer[] arr1 = new Integer[arr.length + 1];
- arr1[0] = number;
- int c = 1;
- for (int i = 0; i < arr.length; i++) {
- arr1[c] = arr[i];
- c++;
- }
- return arr1;
- }
-
- public Integer[] insertAtEndAndCopy(Integer[] arr, Integer number){
- Integer[] newArr = Arrays.copyOf(arr, arr.length+1);
- newArr[arr.length] = number;
- return newArr;
- }
-
- public Integer[] evensArray(Integer[] arr){
- Integer[] evensArr = new Integer[countEvens(arr)];
- int c = 0;
- for (int i = 0; i < arr.length; i++) {
- if (arr[i] % 2 == 0){
- evensArr[c] = arr[i];
- c++;
- }
- }
- return evensArr;
- }
-
- public Integer[] oddsArray(Integer[] arr){
- Integer[] oddsArr = new Integer[countOdds(arr)];
- int c = 0;
- for (int i = 0; i < arr.length; i++) {
- if (arr[i] % 2 != 0){
- oddsArr[c] = arr[i];
- c++;
- }
- }
- return oddsArr;
- }
-
-
- public Integer[] mergeArrays(Integer[] arr1, Integer[] arr2){
- return Stream.concat(Arrays.stream(arr1), Arrays.stream(arr2))
- .toArray(Integer[]::new);
- }
-
- public Integer[] sortArrayIntoEvensThenOdds(Integer[] arr){
- Integer[] newArr = evensArray(arr);
- Integer[] newArr2 = oddsArray(arr);
- return mergeArrays(newArr, newArr2);
- }
-
-
-
- }
|