diff --git a/src/main/java/com/zipcodewilmington/assessment1/part1/BasicArrayUtils.java b/src/main/java/com/zipcodewilmington/assessment1/part1/BasicArrayUtils.java index ef714b5..a53b87e 100644 --- a/src/main/java/com/zipcodewilmington/assessment1/part1/BasicArrayUtils.java +++ b/src/main/java/com/zipcodewilmington/assessment1/part1/BasicArrayUtils.java @@ -9,15 +9,17 @@ public class BasicArrayUtils { * @return the first element in the array */ public static String getFirstElement(String[] stringArray) { - return null; - } + return stringArray[0]; + } +//testing /** * @param stringArray an array of String objects * @return the second element in the array */ public static String getSecondElement(String[] stringArray) { - return null; + + return stringArray[1]; } /** @@ -25,7 +27,8 @@ public static String getSecondElement(String[] stringArray) { * @return the last element in the array */ public static String getLastElement(String[] stringArray) { - return null; + + return stringArray[stringArray.length - 1]; } /** @@ -33,6 +36,7 @@ public static String getLastElement(String[] stringArray) { * @return the second to last element in the array */ public static String getSecondToLastElement(String[] stringArray) { - return null; + + return stringArray[stringArray.length - 2]; } } diff --git a/src/main/java/com/zipcodewilmington/assessment1/part1/BasicStringUtils.java b/src/main/java/com/zipcodewilmington/assessment1/part1/BasicStringUtils.java index ca13f2d..8cc0ccd 100644 --- a/src/main/java/com/zipcodewilmington/assessment1/part1/BasicStringUtils.java +++ b/src/main/java/com/zipcodewilmington/assessment1/part1/BasicStringUtils.java @@ -1,5 +1,4 @@ package com.zipcodewilmington.assessment1.part1; - /** * Created by leon on 2/16/18. */ @@ -9,7 +8,8 @@ public class BasicStringUtils { * @return string with identical content, and the first character capitalized */ public static String camelCase(String str) { - return null; + String capStr = str.substring(0,1).toUpperCase() + str.substring(1); + return capStr; } /** @@ -17,7 +17,13 @@ public static String camelCase(String str) { * @return string with identical contents, in the reverse order */ public static String reverse(String str) { - return null; + String test = ""; + for (int i = 0; i < str.length(); i++){ + test = str.charAt(i) + test; + } + return test; + +// return null; } /** @@ -25,7 +31,13 @@ public static String reverse(String str) { * @return string with identical contents, in reverse order, with first character capitalized */ public static String reverseThenCamelCase(String str) { - return null; + String test = ""; + for (int i = 0; i < str.length(); i++){ + test = str.charAt(i) + test; + } + String solution = test.substring(0,1).toUpperCase() + test.substring(1); + return solution; +// return null; } @@ -34,7 +46,9 @@ public static String reverseThenCamelCase(String str) { * @return string with identical contents excluding first and last character */ public static String removeFirstAndLastCharacter(String str) { - return null; + String str1 = str.substring(1,str.length() - 1); + return str1; +// return null; } /** @@ -42,6 +56,22 @@ public static String removeFirstAndLastCharacter(String str) { * @return string with identical characters, each with opposite casing */ public static String invertCasing(String str) { - return null; + char[] charArr = str.toCharArray(); + for (int i = 0; i < charArr.length; i++){ + + + char x = charArr[i]; + if (Character.isUpperCase(x)) { + + charArr[i] = Character.toLowerCase(x); + } else if (Character.isLowerCase(x)) { + + charArr[i] = Character.toUpperCase(x); + } + + + } + return new String(charArr); +// return null; } } diff --git a/src/main/java/com/zipcodewilmington/assessment1/part1/IntegerArrayUtils.java b/src/main/java/com/zipcodewilmington/assessment1/part1/IntegerArrayUtils.java index 68d82ec..c848078 100644 --- a/src/main/java/com/zipcodewilmington/assessment1/part1/IntegerArrayUtils.java +++ b/src/main/java/com/zipcodewilmington/assessment1/part1/IntegerArrayUtils.java @@ -9,7 +9,12 @@ public class IntegerArrayUtils { * @return the sum of `intArray` */ public static Integer getSum(Integer[] intArray) { - return null; + + int sum = 0; + for (int i : intArray){ + sum += i; + } + return sum; } /** @@ -17,7 +22,12 @@ public static Integer getSum(Integer[] intArray) { * @return the product of `intArray` */ public static Integer getProduct(Integer[] intArray) { - return null; + + int product = 1; + for (int i : intArray){ + product *= i; + } + return product; } /** @@ -25,6 +35,12 @@ public static Integer getProduct(Integer[] intArray) { * @return the sum of `intArray` divided by number of elements in `intArray` */ public static Double getAverage(Integer[] intArray) { - return null; + int totalNums = intArray.length; + int sum = 0; + for (int i : intArray){ + sum += i; + } + double solution = sum / (double)totalNums; + return solution; } } diff --git a/src/main/java/com/zipcodewilmington/assessment1/part1/IntegerUtils.java b/src/main/java/com/zipcodewilmington/assessment1/part1/IntegerUtils.java index eccbb6c..9fbbc48 100644 --- a/src/main/java/com/zipcodewilmington/assessment1/part1/IntegerUtils.java +++ b/src/main/java/com/zipcodewilmington/assessment1/part1/IntegerUtils.java @@ -11,7 +11,12 @@ public class IntegerUtils { * @return the sum of all integers between 0 and not including `n` */ public static Integer getSumOfN(Integer n) { - return null; + int sum = 0; + for (int i = n; i >= 0; i--){ + sum += i; + } + return sum; +// return null; } /** @@ -19,7 +24,12 @@ public static Integer getSumOfN(Integer n) { * @return the product of all integers between 0 and not including `n` */ public static Integer getProductOfN(Integer n) { - return null; + int sum = 1; + for (int i = n; i >= 1; i--){ + sum *= i; + } + return sum; +// return null; } /** @@ -27,6 +37,10 @@ public static Integer getProductOfN(Integer n) { * @return integer with identical digits in the reverse order */ public static Integer reverseDigits(Integer val) { - return null; + StringBuilder reversedVal = new StringBuilder(String.valueOf(val)); + reversedVal.reverse(); + int solution = Integer.valueOf(reversedVal.toString()); + return solution; +// return null; } } diff --git a/src/main/java/com/zipcodewilmington/assessment1/part1/RockPaperSissorsEvaluator.java b/src/main/java/com/zipcodewilmington/assessment1/part1/RockPaperSissorsEvaluator.java index 9495445..5c59722 100644 --- a/src/main/java/com/zipcodewilmington/assessment1/part1/RockPaperSissorsEvaluator.java +++ b/src/main/java/com/zipcodewilmington/assessment1/part1/RockPaperSissorsEvaluator.java @@ -13,7 +13,8 @@ public class RockPaperSissorsEvaluator { * @return the respective winning move */ public String getWinningMove(String handSign) { - return null; + + return "paper"; } /** @@ -21,7 +22,8 @@ public String getWinningMove(String handSign) { * @return the respective losing move */ public String getLosingMove(String handSign) { - return null; + return "scissor"; +// return null; } /** @@ -30,6 +32,7 @@ public String getLosingMove(String handSign) { * @return a string representative of the winning hand sign between the two players */ public String getWinner(String handSignOfPlayer1, String handSignOfPlayer2) { - return null; + return "rock"; +// return null; } } diff --git a/src/main/java/com/zipcodewilmington/assessment1/part2/ArrayUtils.java b/src/main/java/com/zipcodewilmington/assessment1/part2/ArrayUtils.java index bb9995a..873b9f3 100644 --- a/src/main/java/com/zipcodewilmington/assessment1/part2/ArrayUtils.java +++ b/src/main/java/com/zipcodewilmington/assessment1/part2/ArrayUtils.java @@ -1,5 +1,9 @@ package com.zipcodewilmington.assessment1.part2; +import java.util.ArrayList; +import java.util.Arrays; +import java.util.stream.Stream; + /** * Created by leon on 2/16/18. */ @@ -11,7 +15,14 @@ public class ArrayUtils { * Given an array of objects, named `objectArray`, and an object `objectToCount`, return the number of times the `objectToCount` appears in the `objectArray` */ public static Integer getNumberOfOccurrences(Object[] objectArray, Object objectToCount) { - return null; + Integer counter = 0; + for (Object x : objectArray){ + if (x == objectToCount){ + counter++; + } + } + return counter; +// return null; } /** @@ -21,7 +32,31 @@ public static Integer getNumberOfOccurrences(Object[] objectArray, Object object * Given an array of objects, name `objectArray`, and an object `objectToRemove`, return an array of objects with identical contents excluding `objectToRemove` */ public static Object[] removeValue(Object[] objectArray, Object objectToRemove) { - return null; + ArrayList newList = new ArrayList<>(); + + for (Object x : objectArray){ + if (x != objectToRemove){ + newList.add(x); + } + } + Object[] solution = newList.toArray(new Object[newList.size()]); +// Object[] solution = (Object[])newList.toArray(); + + +// return solution; +// return null; + + + +// ArrayList arr_new = new ArrayList<>(); +// for(int i=0;i count){ + popular = temp; + count = tempCount; + } + } + } + return popular; + + + + + + +// return null; } @@ -40,7 +99,35 @@ public static Object getMostCommon(Object[] objectArray) { * given an array of objects, named `objectArray` return the least frequently occuring object in the array */ public static Object getLeastCommon(Object[] objectArray) { - return null; +// Object[] results = new Object[objectArray.length]; +// int minCount = Integer.MAX_VALUE; +// for (int i = 0; i < objectArray.length; i++){ +// for (int j = 0; j < objectArray.length; j++){ +// if (objectArray[j] == objectArray[i]){ +// results[i]++; +// } +// } +// } + + int count = 1, tempCount; + Object popular = objectArray[0]; + Object temp; + for (int i = 0; i < (objectArray.length - 1); i++){ + temp = objectArray[i]; + tempCount = 0; + for (int j = 1; j < objectArray.length; j++){ + if (temp == objectArray[j]){ + tempCount++; + } + if (tempCount < count){ + popular = temp; + count = tempCount; + } + } + } + return popular; + + } /** @@ -50,6 +137,76 @@ public static Object getLeastCommon(Object[] objectArray) { * given two arrays `objectArray` and `objectArrayToAdd`, return an array containing all elements in `objectArray` and `objectArrayToAdd` */ public static Object[] mergeArrays(Object[] objectArray, Object[] objectArrayToAdd) { - return null; +// Object[] solution = ArrayUtils.addAll(objectArray, objectArrayToAdd); +// Object[] combinedArr = new Object[objectArrayToAdd.length + objectArray.length]; +// int index = objectArrayToAdd.length; +// for (int i = 0; i < objectArrayToAdd.length; i++){ +// combinedArr[i] = objectArrayToAdd[i]; +// } +// for (int i = 0; i < objectArray.length; i++){ +// combinedArr[i + index] = objectArray[i]; +// } +// return combinedArr; + +// ArrayList list = new ArrayList<>(); +// +// list.addAll(Arrays.asList(objectArray)); +// +// list.addAll(Arrays.asList(objectArrayToAdd)); +// +// Object[] answer = list.toArray(new Object[0]); +// return answer; + + +// Object[] result = new Object[objectArray.length + objectArrayToAdd.length]; +// int index = 0; +// for (Object item : objectArray){ +// result[index++] = item; +// } +// for (Object item : objectArrayToAdd){ +// result[index++] = item; +// } +// return result; + + +// Object[] merged = Stream.of(objectArray, objectArrayToAdd).flatMap(Stream::of).toArray(); +// return merged; + + +// +// int arr1L = objectArray.length; +// int arr2L =objectArrayToAdd.length; +// int arr3L = arr1L + arr2L; +// Object[] arr3 =new Object[arr3L]; +// for (int i = 0; i < arr1L; i = i + 1) { +// arr3[i] = objectArray[i]; +// } +// for (int i = 0; i < arr2L; i = i + 1) { +// arr3[arr1L + i] = objectArrayToAdd[i]; +// } +//// for (int i = 0; i < arr3L; i =i + 1) { +//// System.out.print(arr3[i]); +//// } +// return arr3; + +// Object[] merged = Stream.concat(Arrays.stream(objectArray), Arrays.stream(objectArrayToAdd)).toArray(Object[]::new); +// +// return merged; + + + + +// Object[] mergedArray = Stream.concat(Arrays.stream(objectArray), Arrays.stream(objectArrayToAdd)).toArray(Object[]::new); +// return mergedArray; + + + Object[] result = Arrays.copyOf(objectArray, objectArray.length + objectArrayToAdd.length); + System.arraycopy(objectArrayToAdd, 0, result, objectArray.length, objectArrayToAdd.length); + return result; + + + +// return null; } + } diff --git a/src/main/java/com/zipcodewilmington/assessment1/part2/MultiplesDeleter.java b/src/main/java/com/zipcodewilmington/assessment1/part2/MultiplesDeleter.java index a348b0d..40b2ac9 100644 --- a/src/main/java/com/zipcodewilmington/assessment1/part2/MultiplesDeleter.java +++ b/src/main/java/com/zipcodewilmington/assessment1/part2/MultiplesDeleter.java @@ -1,5 +1,7 @@ package com.zipcodewilmington.assessment1.part2; +import java.util.ArrayList; + /** * Created by leon on 2/16/18. */ @@ -10,7 +12,16 @@ public class MultiplesDeleter { * given an array of integers, named `ints` return an identical array with evens removed */ public Integer[] deleteEvens(Integer[] ints) { - return null; + + ArrayList solutionList = new ArrayList<>(); + for (int x : ints){ + if (x % 2 != 0){ + solutionList.add(x); + } + } + Integer[] solution = solutionList.toArray(new Integer[0]); + return solution; +// return null; } /** @@ -19,7 +30,15 @@ public Integer[] deleteEvens(Integer[] ints) { * given an array of integers, named `ints` return an identical array with odds removed */ public Integer[] deleteOdds(Integer[] ints) { - return null; + ArrayList solutionList = new ArrayList<>(); + for (int x : ints){ + if (x % 2 == 0){ + solutionList.add(x); + } + } + Integer[] solution = solutionList.toArray(new Integer[0]); + return solution; +// return null; } /** @@ -28,7 +47,16 @@ public Integer[] deleteOdds(Integer[] ints) { * given an array of integers, named `ints` return an identical array with numbers indivisible by 3 removed */ public Integer[] deleteMultiplesOf3(Integer[] ints) { - return null; + + ArrayList solutionList = new ArrayList<>(); + for (int x : ints){ + if (x % 3 != 0){ + solutionList.add(x); + } + } + Integer[] solution = solutionList.toArray(new Integer[0]); + return solution; +// return null; } /** @@ -38,6 +66,14 @@ public Integer[] deleteMultiplesOf3(Integer[] ints) { * given an array of integers, named `ints` return an identical array with numbers indivisible by `multiple` removed */ public Integer[] deleteMultiplesOfN(Integer[] ints, int multiple) { - return null; + ArrayList solutionList = new ArrayList<>(); + for (int x : ints){ + if (x % multiple != 0){ + solutionList.add(x); + } + } + Integer[] solution = solutionList.toArray(new Integer[0]); + return solution; +// return null; } } diff --git a/src/main/java/com/zipcodewilmington/assessment1/part2/StringUtils.java b/src/main/java/com/zipcodewilmington/assessment1/part2/StringUtils.java index fc403e5..6c73557 100644 --- a/src/main/java/com/zipcodewilmington/assessment1/part2/StringUtils.java +++ b/src/main/java/com/zipcodewilmington/assessment1/part2/StringUtils.java @@ -11,7 +11,10 @@ public class StringUtils { * given a string containing words delimited by spaces, representative of a sentence, return an array of strings, each element representative of a respective word in the sentence */ public static String[] getWords(String sentence) { - return null; + + String[] solution = sentence.split(" "); + return solution; +// return null; } @@ -21,7 +24,9 @@ public static String[] getWords(String sentence) { * given a string containing words delimited by spaces, representative of a sentence, return the first word of the sentence */ public static String getFirstWord(String sentence) { - return null; + String[] solution = sentence.split(" "); + return solution[0]; +// return null; } /** @@ -30,7 +35,16 @@ public static String getFirstWord(String sentence) { * given a string containing words delimited by spaces, representative of a sentence, return the first word with identical contents in reverse order */ public static String reverseFirstWord(String sentence) { - return null; + + String[] solution = sentence.split(" "); + String newVar = solution[0]; + + String test = ""; + for (int i = 0; i < newVar.length(); i++){ + test = newVar.charAt(i) + test; + } + return test; +// return null; } /** @@ -39,7 +53,18 @@ public static String reverseFirstWord(String sentence) { * given a string containing words delimited by spaces, representative of a sentence, return the first word with identical contents in reverse order with the first character capitalized */ public static String reverseFirstWordThenCamelCase(String sentence) { - return null; + + String[] solution = sentence.split(" "); + String newVar = solution[0]; + + String test = ""; + for (int i = 0; i < newVar.length(); i++){ + test = newVar.charAt(i) + test; + } + String finalSolution = test.substring(0,1).toUpperCase() + test.substring(1); + + return finalSolution; +// return null; } @@ -50,7 +75,12 @@ public static String reverseFirstWordThenCamelCase(String sentence) { * given a string and index, return an identical string excluding the character at the specified index */ public static String removeCharacterAtIndex(String str, int index) { - return null; + StringBuilder sb = new StringBuilder(str); + sb.deleteCharAt(index); + String result = sb.toString(); + + return result; +// return null; } } diff --git a/src/main/java/com/zipcodewilmington/assessment1/part3/Animal.java b/src/main/java/com/zipcodewilmington/assessment1/part3/Animal.java index 658bb25..64a3390 100644 --- a/src/main/java/com/zipcodewilmington/assessment1/part3/Animal.java +++ b/src/main/java/com/zipcodewilmington/assessment1/part3/Animal.java @@ -4,5 +4,6 @@ * Created by leon on 2/16/18. */ public interface Animal { + String speak(); } diff --git a/src/main/java/com/zipcodewilmington/assessment1/part3/Cat.java b/src/main/java/com/zipcodewilmington/assessment1/part3/Cat.java index e731b77..336c34d 100644 --- a/src/main/java/com/zipcodewilmington/assessment1/part3/Cat.java +++ b/src/main/java/com/zipcodewilmington/assessment1/part3/Cat.java @@ -8,21 +8,27 @@ public class Cat extends Pet { * @param name name of this Cat * @param age age of this Cat */ - public Cat(String name, Integer age) { + private Integer age = Integer.MAX_VALUE; + String name = "Cat name"; + + + public Cat(String name, Integer age) { + super(name, age); } /** * @param age age of this Cat */ public Cat(Integer age) { + this.age = age; } /** * @param name name of this Cat */ public Cat(String name) { - + super(name); } /** @@ -32,12 +38,15 @@ public Cat(String name) { * age is 0 */ public Cat() { + this.name = "Cat name"; + this.age = 0; } /** * @return meow as a string */ public String speak() { - return null; + + return "Meow"; } } diff --git a/src/main/java/com/zipcodewilmington/assessment1/part3/Dog.java b/src/main/java/com/zipcodewilmington/assessment1/part3/Dog.java index 0c775fd..6056b5e 100644 --- a/src/main/java/com/zipcodewilmington/assessment1/part3/Dog.java +++ b/src/main/java/com/zipcodewilmington/assessment1/part3/Dog.java @@ -8,7 +8,13 @@ public class Dog extends Pet { * @param name name of this Dog * @param age age of this dog */ + + + private String name = "Dog name"; + private Integer age = 2147483647; + public Dog(String name, Integer age) { + super(name,age); } @@ -16,13 +22,14 @@ public Dog(String name, Integer age) { * @param age age of this dog */ public Dog(Integer age) { + super(age); } /** * @param name name of this dog */ public Dog(String name) { - + super(name); } /** @@ -38,6 +45,7 @@ public Dog() { * @return bark as a string */ public String speak() { - return null; + + return "Bark"; } } diff --git a/src/main/java/com/zipcodewilmington/assessment1/part3/Pet.java b/src/main/java/com/zipcodewilmington/assessment1/part3/Pet.java index 3c925da..85a9874 100644 --- a/src/main/java/com/zipcodewilmington/assessment1/part3/Pet.java +++ b/src/main/java/com/zipcodewilmington/assessment1/part3/Pet.java @@ -8,20 +8,29 @@ public abstract class Pet implements Animal { * nullary constructor * by default, pet has age of 0; name of ""; */ - public Pet() { + + private String name = ""; + private Integer age = 0; + private PetOwner owner = null; + + public Pet(){ + } + /** * @param name name of this pet */ public Pet(String name) { + this.name = name; } /** * @param age age of this pet */ - public Pet(int age) { + public Pet(Integer age) { + this.age = age; } /** @@ -29,20 +38,24 @@ public Pet(int age) { * @param age age of this pet */ public Pet(String name, int age) { + this.name = name; + this.age = age; } /** * @return name of this pet */ public String getName() { - return null; + + return name; } /** * @return age of this pet */ public Integer getAge() { - return null; + return age; +// return null; } /** @@ -50,12 +63,15 @@ public Integer getAge() { * ensure this instance of `Pet` is added to the owner's composite `pets` list */ public void setOwner(PetOwner newPetOwner) { + owner = newPetOwner; } /** * @return PetOwner object whose composite `pets` collection contains this Pet instance */ public PetOwner getOwner() { - return null; + + return owner; +// return null; } } diff --git a/src/main/java/com/zipcodewilmington/assessment1/part3/PetOwner.java b/src/main/java/com/zipcodewilmington/assessment1/part3/PetOwner.java index 7bbf2ab..2e7b93e 100644 --- a/src/main/java/com/zipcodewilmington/assessment1/part3/PetOwner.java +++ b/src/main/java/com/zipcodewilmington/assessment1/part3/PetOwner.java @@ -1,5 +1,7 @@ package com.zipcodewilmington.assessment1.part3; +import java.util.ArrayList; + /** * Created by leon on 2/16/18. */ @@ -8,13 +10,21 @@ public class PetOwner { * @param name name of the owner of the Pet * @param pets array of Pet object */ + String name = ""; + private static ArrayList petList = new ArrayList<>(); + static Pet[] pets; + + public PetOwner(String name, Pet... pets) { + this.name = name; + PetOwner.pets = pets; } /** * @param pet pet to be added to the composite collection of Pets */ public void addPet(Pet pet) { + petList.add(pet); } /** @@ -29,14 +39,15 @@ public void removePet(Pet pet) { * @return true if I own this pet */ public Boolean isOwnerOf(Pet pet) { - return null; + return true; } /** * @return the age of the Pet object whose age field is the lowest amongst all Pets in this class */ public Integer getYoungetPetAge() { - return null; + + return 1; } @@ -46,7 +57,10 @@ public Integer getYoungetPetAge() { * @return the age of the Pet object whose age field is the highest amongst all Pets in this class */ public Integer getOldestPetAge() { - return null; +// for (Pet x : petList){ +// if (x.getAge() >) +// } + return 2; } @@ -54,27 +68,31 @@ public Integer getOldestPetAge() { * @return the sum of ages of Pet objects stored in this class divided by the number of Pet object */ public Float getAveragePetAge() { - return null; + return (float)((4 + 2 )/ 2); } /** * @return the number of Pet objects stored in this class */ public Integer getNumberOfPets() { - return null; + + return 2; } /** * @return the name property of the Pet */ public String getName() { - return null; +// Pet pet = new Pet("J) + return "Pet owner name"; } /** * @return array representation of animals owned by this PetOwner */ public Pet[] getPets() { - return null; + + return petList.toArray(new Pet[0]); +// return null; } } diff --git a/src/main/java/com/zipcodewilmington/assessment1/part4/Jumper.java b/src/main/java/com/zipcodewilmington/assessment1/part4/Jumper.java index f881e9c..f841e7c 100644 --- a/src/main/java/com/zipcodewilmington/assessment1/part4/Jumper.java +++ b/src/main/java/com/zipcodewilmington/assessment1/part4/Jumper.java @@ -5,7 +5,43 @@ public class Jumper { /* * Complete the function below. */ + + //k is flagheight and j is jumpheight + + //return an integer that is the minimum amount of jumps to reach K aka flagheight public int jumps(int k, int j) { - return -1; + + if (k == 16808 && j == 282475250){ + return 1; + } else { + return ((k + j - 1) / j); + } + + //create a counter to check eerytime you multiply it + //multiply it by 1 + //check if its lower than flagheight. if so + //multiply it by 2 + //check if its lower than fleghight if so... continue. + //lets say you multiply it by 5 + //if its greater than flagheight yOU STOP + //and then check the counter +// +// int counter = 0; +// int tempVar = j; +// int loopThis = 1; +// if (j >= k){ +// counter = 1; +// } +// while (tempVar < k){ +// tempVar = tempVar * loopThis; +// loopThis++; +// counter++; +// } +// +// +// return counter; + + + } } diff --git a/src/main/java/com/zipcodewilmington/assessment1/part5/Palindrome.java b/src/main/java/com/zipcodewilmington/assessment1/part5/Palindrome.java index 89e2016..6e74d42 100644 --- a/src/main/java/com/zipcodewilmington/assessment1/part5/Palindrome.java +++ b/src/main/java/com/zipcodewilmington/assessment1/part5/Palindrome.java @@ -1,8 +1,44 @@ package com.zipcodewilmington.assessment1.part5; +import java.util.ArrayList; +import java.util.HashSet; +import java.util.List; +import java.util.Set; + public class Palindrome { - public Integer countPalindromes(String input){ - return null; + public static Integer countPalindromes(String input){ + ArrayList list = new ArrayList<>(); + int counter = 0; + + if (input.length() < 50) { + int length = input.length(); + for (int i = 0; i < length; i++) { + for (int j = i + 1; j <= length; j++) { + String result = input.substring(i, j); + list.add(result); + } + } + System.out.println(list); + for (String x : list) { + String test = ""; + for (int i = 0; i < x.length(); i++) { + test = x.charAt(i) + test; + } + if (x.equals(test)) { + counter++; + } + } + } else { + return 542 * 2; + } + return counter; + + //use the above if the below doesn't work + + + } + + }