From 6c3c88398fc1eb78106bef508b8994d34d5c26ba Mon Sep 17 00:00:00 2001 From: aartikansal Date: Fri, 6 Mar 2020 09:52:30 -0500 Subject: [PATCH 1/6] basic utilities done --- .../assessment2/part1/BasicUtilities.java | 10 ++++++---- 1 file changed, 6 insertions(+), 4 deletions(-) diff --git a/src/main/java/com/zipcodewilmington/assessment2/part1/BasicUtilities.java b/src/main/java/com/zipcodewilmington/assessment2/part1/BasicUtilities.java index 1402353..b11457e 100644 --- a/src/main/java/com/zipcodewilmington/assessment2/part1/BasicUtilities.java +++ b/src/main/java/com/zipcodewilmington/assessment2/part1/BasicUtilities.java @@ -2,18 +2,20 @@ public class BasicUtilities { public Boolean isGreaterThan5(Integer value) { - return null; + return value >= 5; } public Boolean isLessThan7(Integer value) { - return null; + return value<= 7; } public Boolean isBetween5And7(Integer valueToEvaluate) { - return null; + + return isGreaterThan5(valueToEvaluate)&& isLessThan7(valueToEvaluate); } public Boolean startsWith(String string, Character character) { - return null; + + return(string.charAt(0)== character || string.toLowerCase().charAt(0)==character); } } From eaaa1ac0a6d5ca875f6be37da56a46fd4285e69b Mon Sep 17 00:00:00 2001 From: aartikansal Date: Fri, 6 Mar 2020 10:04:04 -0500 Subject: [PATCH 2/6] section 1 part2 done --- .../part1/IntegerArrayUtilities.java | 19 +++++++++++++++---- 1 file changed, 15 insertions(+), 4 deletions(-) diff --git a/src/main/java/com/zipcodewilmington/assessment2/part1/IntegerArrayUtilities.java b/src/main/java/com/zipcodewilmington/assessment2/part1/IntegerArrayUtilities.java index a360000..59f7dc5 100644 --- a/src/main/java/com/zipcodewilmington/assessment2/part1/IntegerArrayUtilities.java +++ b/src/main/java/com/zipcodewilmington/assessment2/part1/IntegerArrayUtilities.java @@ -1,19 +1,30 @@ package com.zipcodewilmington.assessment2.part1; +import sun.security.util.Length; + public class IntegerArrayUtilities { public Boolean hasEvenLength(Integer[] array) { - return null; + return array.length % 2==0; } public Integer[] range(int start, int stop) { - return null; + int arrayLength= stop-start+1; + Integer[] result= new Integer[arrayLength]; + result[0]=start; + for(int i=0; i Date: Fri, 6 Mar 2020 10:25:21 -0500 Subject: [PATCH 3/6] part 3 section one done --- .../assessment2/part1/WuTangConcatenator.java | 22 +++++++++++++------ 1 file changed, 15 insertions(+), 7 deletions(-) diff --git a/src/main/java/com/zipcodewilmington/assessment2/part1/WuTangConcatenator.java b/src/main/java/com/zipcodewilmington/assessment2/part1/WuTangConcatenator.java index 63f210e..a0fce16 100644 --- a/src/main/java/com/zipcodewilmington/assessment2/part1/WuTangConcatenator.java +++ b/src/main/java/com/zipcodewilmington/assessment2/part1/WuTangConcatenator.java @@ -1,18 +1,26 @@ package com.zipcodewilmington.assessment2.part1; public class WuTangConcatenator { + +private Integer input; public WuTangConcatenator(Integer input) { - } + this.input =input; +} public Boolean isWu() { - return null; + + + return input%3 ==0; + } public Boolean isTang() { - return null; - } - public Boolean isWuTang() { - return null; + return input % 5==0; } -} + + public Boolean isWuTang() { + return isWu()&& isTang(); + + } + } \ No newline at end of file From 852905c3b486bb8620d7d3dea125867bed3b323e Mon Sep 17 00:00:00 2001 From: aartikansal Date: Fri, 6 Mar 2020 11:36:42 -0500 Subject: [PATCH 4/6] final submisiion --- .../assessment2/part2/ArrayUtility.java | 58 ++++++++++++++++--- .../assessment2/part3/BlueJay.java | 13 ++++- .../assessment2/part3/Horse.java | 12 +++- .../assessment2/part3/RedRobin.java | 24 +++++++- .../assessment2/part3/SpeedComparator.java | 9 ++- 5 files changed, 105 insertions(+), 11 deletions(-) diff --git a/src/main/java/com/zipcodewilmington/assessment2/part2/ArrayUtility.java b/src/main/java/com/zipcodewilmington/assessment2/part2/ArrayUtility.java index de2f799..32b6d97 100644 --- a/src/main/java/com/zipcodewilmington/assessment2/part2/ArrayUtility.java +++ b/src/main/java/com/zipcodewilmington/assessment2/part2/ArrayUtility.java @@ -1,19 +1,63 @@ package com.zipcodewilmington.assessment2.part2; +import java.util.ArrayList; +import java.util.Arrays; + public class ArrayUtility { public Integer[] merge(Integer[] array1, Integer[] array2) { - return null; + + ArrayListnewList=new ArrayList(); + + + int newLength =array1.length+ array2.length; + newList.addAll(Arrays.asList(array1)); + newList.addAll(Arrays.asList(array2)); + return newList.toArray(new Integer[newLength]); } public Integer[] rotate(Integer[] array, Integer index) { - return null; - } + Integer[] newArray = new Integer[array.length]; + for (int i = array.length - 1; i >= 0; i--) { + if (i - index >= 0) { + newArray[i - index] = array[i]; + } else { + newArray[i - index + array.length] = array[i]; + } + } + return newArray; + } +public static Integer getNumberOfOcurrences(Integer[] array, Integer valueToCount) { + int numOfOccurrences = 0; + for (Integer value : array) { + if (value == valueToCount) + numOfOccurrences = numOfOccurrences + 1; + } + return numOfOccurrences; +} public Integer countOccurrence(Integer[] array1, Integer[] array2, Integer valueToEvaluate) { - return null; +//Integer[] mergedArray= merge[array1,array2]; +return null;//getNumberOfOcurrences(mergedArray, valueToEvaluate); } + public Integer mostCommon(Integer[] array) { - return null; - } -} + + //Integer[] occurrences = new Integer[array.length]; + // for (int i = 0; i < array.length; i++) { + // occurrences[i] = getNumberOfOccurrences(array, array[i]); + // } + // find most common (max # of occurrences) and return + //int max = occurrences[0]; + // int maxIdx = 0; + // for (int i = 1; i < occurrences.length; i++) { + // if (occurrences[i] > max) { + // max = occurrences[i]; + // maxIdx = i; + // } + // } + return null; + }} + + + diff --git a/src/main/java/com/zipcodewilmington/assessment2/part3/BlueJay.java b/src/main/java/com/zipcodewilmington/assessment2/part3/BlueJay.java index f18d13a..9dae8b5 100644 --- a/src/main/java/com/zipcodewilmington/assessment2/part3/BlueJay.java +++ b/src/main/java/com/zipcodewilmington/assessment2/part3/BlueJay.java @@ -1,4 +1,15 @@ package com.zipcodewilmington.assessment2.part3; -public class BlueJay { +public class BlueJay extends Bird { + public BlueJay(){ + + } + + + public String color() { + return "blue"; + } + public int getSpeed(){ + return 13; + } } diff --git a/src/main/java/com/zipcodewilmington/assessment2/part3/Horse.java b/src/main/java/com/zipcodewilmington/assessment2/part3/Horse.java index e78cf2b..b81ef2e 100644 --- a/src/main/java/com/zipcodewilmington/assessment2/part3/Horse.java +++ b/src/main/java/com/zipcodewilmington/assessment2/part3/Horse.java @@ -1,4 +1,14 @@ package com.zipcodewilmington.assessment2.part3; -public class Horse{ +public class Horse implements Animal{ + public String move(){ + return "gallop"; + } + public String color(){ + return "brown"; + } + + public int getSpeed() { + return 40; + } } diff --git a/src/main/java/com/zipcodewilmington/assessment2/part3/RedRobin.java b/src/main/java/com/zipcodewilmington/assessment2/part3/RedRobin.java index c1e85f2..43fbd84 100644 --- a/src/main/java/com/zipcodewilmington/assessment2/part3/RedRobin.java +++ b/src/main/java/com/zipcodewilmington/assessment2/part3/RedRobin.java @@ -1,4 +1,26 @@ package com.zipcodewilmington.assessment2.part3; -public class RedRobin { +public class RedRobin extends Bird{ + String migrationMonth; + public RedRobin(){ + } + + + public String color(){ + return "red"; + + } + public int getSpeed(){ + return 10; + } + + + @Override + public String getMigrationMonth() { + return migrationMonth; + } + @Override + public void setMigrationMonth(String migrationMonth){ + this.migrationMonth = migrationMonth; + } } diff --git a/src/main/java/com/zipcodewilmington/assessment2/part3/SpeedComparator.java b/src/main/java/com/zipcodewilmington/assessment2/part3/SpeedComparator.java index 532e766..04c960a 100644 --- a/src/main/java/com/zipcodewilmington/assessment2/part3/SpeedComparator.java +++ b/src/main/java/com/zipcodewilmington/assessment2/part3/SpeedComparator.java @@ -1,4 +1,11 @@ package com.zipcodewilmington.assessment2.part3; -public class SpeedComparator { + +import java.util.Comparator; + +public class SpeedComparator implements Comparator { + public int compare(Animal animal1, Animal animal2) { + return animal2.getSpeed() - animal1.getSpeed(); + } + } From 9c56f9aa07db984fa4d4fd0fb883838a8fb27fea Mon Sep 17 00:00:00 2001 From: aartikansal Date: Fri, 6 Mar 2020 13:28:16 -0500 Subject: [PATCH 5/6] changes --- .../assessment2/part1/IntegerArrayUtilities.java | 15 +++++++-------- 1 file changed, 7 insertions(+), 8 deletions(-) diff --git a/src/main/java/com/zipcodewilmington/assessment2/part1/IntegerArrayUtilities.java b/src/main/java/com/zipcodewilmington/assessment2/part1/IntegerArrayUtilities.java index 59f7dc5..4f7fc44 100644 --- a/src/main/java/com/zipcodewilmington/assessment2/part1/IntegerArrayUtilities.java +++ b/src/main/java/com/zipcodewilmington/assessment2/part1/IntegerArrayUtilities.java @@ -8,14 +8,13 @@ public Boolean hasEvenLength(Integer[] array) { } public Integer[] range(int start, int stop) { - int arrayLength= stop-start+1; - Integer[] result= new Integer[arrayLength]; - result[0]=start; - for(int i=0; i Date: Fri, 6 Mar 2020 13:48:46 -0500 Subject: [PATCH 6/6] changes --- .../assessment2/part2/ArrayUtility.java | 20 ++++++++++++++++++- 1 file changed, 19 insertions(+), 1 deletion(-) diff --git a/src/main/java/com/zipcodewilmington/assessment2/part2/ArrayUtility.java b/src/main/java/com/zipcodewilmington/assessment2/part2/ArrayUtility.java index 32b6d97..d9e280c 100644 --- a/src/main/java/com/zipcodewilmington/assessment2/part2/ArrayUtility.java +++ b/src/main/java/com/zipcodewilmington/assessment2/part2/ArrayUtility.java @@ -42,6 +42,24 @@ public Integer countOccurrence(Integer[] array1, Integer[] array2, Integer value public Integer mostCommon(Integer[] array) { + int count = 1, tempCount; + int popular = array[0]; + int temp = 0; + for (int i = 0; i < (array.length - 1); i++) + temp = array[i]; + { + tempCount = 0; + for (int j = 1; j < array.length; j++) { + if (temp == array[j]) + tempCount++; + } + if (tempCount > count) { + popular = temp; + count = tempCount; + + } + } + return popular; //Integer[] occurrences = new Integer[array.length]; // for (int i = 0; i < array.length; i++) { @@ -56,7 +74,7 @@ public Integer mostCommon(Integer[] array) { // maxIdx = i; // } // } - return null; + }}