From a6d90a605b5abc38a8d3d4691080c6431901ab75 Mon Sep 17 00:00:00 2001 From: "github-classroom[bot]" <66690702+github-classroom[bot]@users.noreply.github.com> Date: Mon, 8 Jul 2024 13:26:29 +0000 Subject: [PATCH 01/10] Setting up GitHub Classroom Feedback From 4811202dd6c5180fd4096cb2dd36bba6a013ab2a Mon Sep 17 00:00:00 2001 From: CITATS928 <93238522+CITATS928@users.noreply.github.com> Date: Mon, 8 Jul 2024 09:34:01 -0400 Subject: [PATCH 02/10] BasicArrayUtilsTest passed --- .../assessment1/part1/BasicArrayUtils.java | 15 +++++++++++---- 1 file changed, 11 insertions(+), 4 deletions(-) diff --git a/src/main/java/com/zipcodewilmington/assessment1/part1/BasicArrayUtils.java b/src/main/java/com/zipcodewilmington/assessment1/part1/BasicArrayUtils.java index ef714b5..95f6eea 100644 --- a/src/main/java/com/zipcodewilmington/assessment1/part1/BasicArrayUtils.java +++ b/src/main/java/com/zipcodewilmington/assessment1/part1/BasicArrayUtils.java @@ -9,7 +9,10 @@ public class BasicArrayUtils { * @return the first element in the array */ public static String getFirstElement(String[] stringArray) { - return null; + return stringArray[0]; + + + // return null; } /** @@ -17,7 +20,7 @@ public static String getFirstElement(String[] stringArray) { * @return the second element in the array */ public static String getSecondElement(String[] stringArray) { - return null; + return stringArray[1]; } /** @@ -25,7 +28,9 @@ 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]; + + // return null; } /** @@ -33,6 +38,8 @@ 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]; +// +// return null; } } From ecbee18981e025585898d3cfe52b5ddc9c4d1c18 Mon Sep 17 00:00:00 2001 From: CITATS928 <93238522+CITATS928@users.noreply.github.com> Date: Mon, 8 Jul 2024 10:14:01 -0400 Subject: [PATCH 03/10] Finished IntegerArrayUtils --- .../assessment1/part1/BasicStringUtils.java | 47 +++++++++++++++++-- .../assessment1/part1/IntegerArrayUtils.java | 23 +++++++-- 2 files changed, 62 insertions(+), 8 deletions(-) diff --git a/src/main/java/com/zipcodewilmington/assessment1/part1/BasicStringUtils.java b/src/main/java/com/zipcodewilmington/assessment1/part1/BasicStringUtils.java index ca13f2d..1e65893 100644 --- a/src/main/java/com/zipcodewilmington/assessment1/part1/BasicStringUtils.java +++ b/src/main/java/com/zipcodewilmington/assessment1/part1/BasicStringUtils.java @@ -1,5 +1,10 @@ package com.zipcodewilmington.assessment1.part1; +import java.sql.Array; +import java.util.Arrays; +import java.util.Locale; + + /** * Created by leon on 2/16/18. */ @@ -9,7 +14,21 @@ public class BasicStringUtils { * @return string with identical content, and the first character capitalized */ public static String camelCase(String str) { - return null; +// String[] arr = str.split(" "); +// System.out.println(arr[0].toUpperCase(Locale.ROOT)); +// String temp=arr[0].toUpperCase(Locale.ROOT); +// arr[0]=temp; +// String result=""; +// for(int i=0;i Date: Mon, 8 Jul 2024 10:33:51 -0400 Subject: [PATCH 04/10] Finished part 1 --- .../assessment1/part1/IntegerUtils.java | 23 +++++++++++++-- .../part1/RockPaperSissorsEvaluator.java | 28 ++++++++++++++++++- 2 files changed, 47 insertions(+), 4 deletions(-) diff --git a/src/main/java/com/zipcodewilmington/assessment1/part1/IntegerUtils.java b/src/main/java/com/zipcodewilmington/assessment1/part1/IntegerUtils.java index eccbb6c..81779b5 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 temp=0; + for(int i=0; i<=n;i++){ + temp+=i; + } + + return temp; } /** @@ -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 temp=1; + for(int i=1; i<=n;i++){ + temp*=i; + } + + return temp; } /** @@ -27,6 +37,13 @@ public static Integer getProductOfN(Integer n) { * @return integer with identical digits in the reverse order */ public static Integer reverseDigits(Integer val) { - return null; + String strval=val.toString(); + StringBuilder newstr = new StringBuilder(strval); + newstr.reverse().toString(); + strval = newstr.toString(); + int reult = Integer.parseInt(strval); + + + return reult; } } diff --git a/src/main/java/com/zipcodewilmington/assessment1/part1/RockPaperSissorsEvaluator.java b/src/main/java/com/zipcodewilmington/assessment1/part1/RockPaperSissorsEvaluator.java index 9495445..3892a4c 100644 --- a/src/main/java/com/zipcodewilmington/assessment1/part1/RockPaperSissorsEvaluator.java +++ b/src/main/java/com/zipcodewilmington/assessment1/part1/RockPaperSissorsEvaluator.java @@ -13,6 +13,15 @@ public class RockPaperSissorsEvaluator { * @return the respective winning move */ public String getWinningMove(String handSign) { + if(handSign == ROCK){ + return PAPER; + }else if(handSign==PAPER){ + return SCISSOR; + }else if(handSign==SCISSOR){ + return ROCK; + } + + return null; } @@ -21,6 +30,15 @@ public String getWinningMove(String handSign) { * @return the respective losing move */ public String getLosingMove(String handSign) { + if(handSign == ROCK){ + return SCISSOR; + }else if(handSign==PAPER){ + return ROCK; + }else if(handSign==SCISSOR){ + return PAPER; + } + + return null; } @@ -30,6 +48,14 @@ 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; + if(handSignOfPlayer1==ROCK&&handSignOfPlayer2==SCISSOR || + handSignOfPlayer1==PAPER&&handSignOfPlayer2==ROCK || + handSignOfPlayer1==SCISSOR&&handSignOfPlayer2==PAPER ){ + return handSignOfPlayer1; + }else { + return handSignOfPlayer2; + } + + //return null; } } From 748e78a244b032682a8207bbf8ea3bc8b7c98b23 Mon Sep 17 00:00:00 2001 From: CITATS928 <93238522+CITATS928@users.noreply.github.com> Date: Mon, 8 Jul 2024 12:50:43 -0400 Subject: [PATCH 05/10] finished part of part3 --- .../assessment1/part2/ArrayUtils.java | 55 ++++++++++++++++++- .../assessment1/part2/MultiplesDeleter.java | 3 + .../assessment1/part3/Cat.java | 9 ++- .../assessment1/part3/Dog.java | 8 ++- .../assessment1/part3/Pet.java | 20 ++++++- .../assessment1/part3/PetOwner.java | 51 ++++++++++++++--- 6 files changed, 128 insertions(+), 18 deletions(-) diff --git a/src/main/java/com/zipcodewilmington/assessment1/part2/ArrayUtils.java b/src/main/java/com/zipcodewilmington/assessment1/part2/ArrayUtils.java index bb9995a..90e4afa 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.LinkedList; + /** * 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; + int counter =0; + for(Object i:objectArray){ + if(objectToCount==i){ + counter++; + } + } + + return counter; } /** @@ -21,6 +32,27 @@ 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) { + +// ArrayList arrayList= new ArrayList<>(); +// +// for(Object i:objectArray){ +// if(objectToRemove!=i){ +// arrayList.add(i); +// } +// } +// +// Object[] rrrrr = new Object[arrayList.size()]; +// for(int i=0;i< arrayList.size();i++){ +// rrrrr[i]= (Object) arrayList.get(i); +// } +// +// Object[] result1= new Object[arrayList.size()]; +// result1 = (Object[]) arrayList.toArray(); +// +// Object[] result= arrayList.toArray(); +// System.out.println(Arrays.toString(result)); +// +// return rrrrr; return null; } @@ -30,6 +62,8 @@ public static Object[] removeValue(Object[] objectArray, Object objectToRemove) * given an array of objects, named `objectArray` return the most frequently occuring object in the array */ public static Object getMostCommon(Object[] objectArray) { + + return null; } @@ -50,6 +84,23 @@ 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[] result = new Object[objectArray.length+objectArrayToAdd.length]; + int length = objectArray.length+objectArrayToAdd.length;//12 + System.out.println(length); + + + + for(int i=0;i<=objectArray.length-1;i++){ + result[i]= objectArray[i]; + + } + for(int i=objectArray.length;i<=length-1;i++){ + result[i]= objectArrayToAdd[i-objectArray.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..77595e9 100644 --- a/src/main/java/com/zipcodewilmington/assessment1/part2/MultiplesDeleter.java +++ b/src/main/java/com/zipcodewilmington/assessment1/part2/MultiplesDeleter.java @@ -10,6 +10,9 @@ public class MultiplesDeleter { * given an array of integers, named `ints` return an identical array with evens removed */ public Integer[] deleteEvens(Integer[] ints) { + + + return null; } diff --git a/src/main/java/com/zipcodewilmington/assessment1/part3/Cat.java b/src/main/java/com/zipcodewilmington/assessment1/part3/Cat.java index e731b77..da1a098 100644 --- a/src/main/java/com/zipcodewilmington/assessment1/part3/Cat.java +++ b/src/main/java/com/zipcodewilmington/assessment1/part3/Cat.java @@ -9,19 +9,22 @@ public class Cat extends Pet { * @param age age of this Cat */ public Cat(String name, Integer age) { - + super(name,age); } /** * @param age age of this Cat */ public Cat(Integer age) { + super("Cat name",age); + //super(age); } /** * @param name name of this Cat */ public Cat(String name) { + super(name); } @@ -32,12 +35,14 @@ public Cat(String name) { * age is 0 */ public Cat() { + super("Cat name",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..65dc924 100644 --- a/src/main/java/com/zipcodewilmington/assessment1/part3/Dog.java +++ b/src/main/java/com/zipcodewilmington/assessment1/part3/Dog.java @@ -9,20 +9,21 @@ public class Dog extends Pet { * @param age age of this dog */ public Dog(String name, Integer age) { - + super(name,age); } /** * @param age age of this dog */ public Dog(Integer age) { + super("Dog name",age); } /** * @param name name of this dog */ public Dog(String name) { - + super(name); } /** @@ -32,12 +33,13 @@ public Dog(String name) { * age is 0 */ public Dog() { + super("Dog name",0); } /** * @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..d81d4de 100644 --- a/src/main/java/com/zipcodewilmington/assessment1/part3/Pet.java +++ b/src/main/java/com/zipcodewilmington/assessment1/part3/Pet.java @@ -4,17 +4,23 @@ * Created by leon on 2/16/18. */ public abstract class Pet implements Animal { + String name; + int age; + PetOwner Owner; /** * nullary constructor * by default, pet has age of 0; name of ""; */ public Pet() { + this("",0); } /** * @param name name of this pet */ public Pet(String name) { + this(name,0); + //this.name=name; } @@ -22,6 +28,8 @@ public Pet(String name) { * @param age age of this pet */ public Pet(int age) { + this("",age); + //this.age = age; } /** @@ -29,20 +37,25 @@ 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 this.name; } + + /** * @return age of this pet */ public Integer getAge() { - return null; + return this.age; } /** @@ -50,12 +63,13 @@ public Integer getAge() { * ensure this instance of `Pet` is added to the owner's composite `pets` list */ public void setOwner(PetOwner newPetOwner) { + this.Owner=newPetOwner; } /** * @return PetOwner object whose composite `pets` collection contains this Pet instance */ public PetOwner getOwner() { - return null; + return this.Owner; } } diff --git a/src/main/java/com/zipcodewilmington/assessment1/part3/PetOwner.java b/src/main/java/com/zipcodewilmington/assessment1/part3/PetOwner.java index 7bbf2ab..a436625 100644 --- a/src/main/java/com/zipcodewilmington/assessment1/part3/PetOwner.java +++ b/src/main/java/com/zipcodewilmington/assessment1/part3/PetOwner.java @@ -1,27 +1,41 @@ package com.zipcodewilmington.assessment1.part3; +import java.util.ArrayList; +import java.util.Arrays; +import java.util.List; + /** * Created by leon on 2/16/18. */ public class PetOwner { + String name; + List pets; + /** * @param name name of the owner of the Pet * @param pets array of Pet object */ public PetOwner(String name, Pet... pets) { + this.name=name; + if(pets!=null) { + this.pets = new ArrayList<>(Arrays.asList(pets)); + }else{ + this.pets=new ArrayList<>(); + } } /** * @param pet pet to be added to the composite collection of Pets */ public void addPet(Pet pet) { + this.pets.add(pet); } /** * @param pet pet to be removed from the composite collection Pets */ public void removePet(Pet pet) { - + pets.remove(pets.get(0)); } /** @@ -29,14 +43,22 @@ public void removePet(Pet pet) { * @return true if I own this pet */ public Boolean isOwnerOf(Pet pet) { - return null; + return this.pets.contains(pet); + + //return null; } /** * @return the age of the Pet object whose age field is the lowest amongst all Pets in this class */ public Integer getYoungetPetAge() { - return null; + int num = 500000; + for(Pet pet:pets){ + if(pet.getAge()num){ + num = pet.getAge(); + } + } + return num; + //return null; + } @@ -54,27 +84,32 @@ 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; + int num =0; + for(Pet pet:pets){ + num+=pet.getAge(); + } + float result = (float) num/pets.size(); + return result; } /** * @return the number of Pet objects stored in this class */ public Integer getNumberOfPets() { - return null; + return this.pets.size(); } /** * @return the name property of the Pet */ public String getName() { - return null; + return this.name; } /** * @return array representation of animals owned by this PetOwner */ public Pet[] getPets() { - return null; + return this.pets.toArray(new Pet[0]); } } From 3f84d14311dfdb34fd17bd230f284e4651f82015 Mon Sep 17 00:00:00 2001 From: CITATS928 <93238522+CITATS928@users.noreply.github.com> Date: Mon, 8 Jul 2024 13:06:03 -0400 Subject: [PATCH 06/10] finished part 4 --- .../zipcodewilmington/assessment1/part4/Jumper.java | 13 +++++++++++-- 1 file changed, 11 insertions(+), 2 deletions(-) diff --git a/src/main/java/com/zipcodewilmington/assessment1/part4/Jumper.java b/src/main/java/com/zipcodewilmington/assessment1/part4/Jumper.java index f881e9c..78662ab 100644 --- a/src/main/java/com/zipcodewilmington/assessment1/part4/Jumper.java +++ b/src/main/java/com/zipcodewilmington/assessment1/part4/Jumper.java @@ -5,7 +5,16 @@ public class Jumper { /* * Complete the function below. */ - public int jumps(int k, int j) { - return -1; + public int jumps(int flagHeight, int junpHeight) { + int jump = flagHeight/junpHeight; + if(junpHeight>flagHeight){ + return flagHeight; + } + int rest = flagHeight%junpHeight; + if(rest!=0){ + return jump+rest; + } + + return jump; } } From 738c0ada0f9a019adad4a91e12e8585246ed867e Mon Sep 17 00:00:00 2001 From: CITATS928 <93238522+CITATS928@users.noreply.github.com> Date: Mon, 8 Jul 2024 13:37:30 -0400 Subject: [PATCH 07/10] part 5 finish --- .../assessment1/part5/Palindrome.java | 18 +++++++++++++++++- 1 file changed, 17 insertions(+), 1 deletion(-) diff --git a/src/main/java/com/zipcodewilmington/assessment1/part5/Palindrome.java b/src/main/java/com/zipcodewilmington/assessment1/part5/Palindrome.java index 89e2016..64a7621 100644 --- a/src/main/java/com/zipcodewilmington/assessment1/part5/Palindrome.java +++ b/src/main/java/com/zipcodewilmington/assessment1/part5/Palindrome.java @@ -1,8 +1,24 @@ package com.zipcodewilmington.assessment1.part5; +import java.sql.SQLOutput; + public class Palindrome { public Integer countPalindromes(String input){ - return null; + int size=input.length(); + int counter =size; + System.out.println(size); + + for(int i=0;i Date: Mon, 8 Jul 2024 13:52:46 -0400 Subject: [PATCH 08/10] finished part 2.2 --- .../assessment1/part2/MultiplesDeleter.java | 41 ++++++++++++++++--- 1 file changed, 35 insertions(+), 6 deletions(-) diff --git a/src/main/java/com/zipcodewilmington/assessment1/part2/MultiplesDeleter.java b/src/main/java/com/zipcodewilmington/assessment1/part2/MultiplesDeleter.java index 77595e9..1181f54 100644 --- a/src/main/java/com/zipcodewilmington/assessment1/part2/MultiplesDeleter.java +++ b/src/main/java/com/zipcodewilmington/assessment1/part2/MultiplesDeleter.java @@ -1,5 +1,8 @@ package com.zipcodewilmington.assessment1.part2; +import java.util.ArrayList; +import java.util.List; + /** * Created by leon on 2/16/18. */ @@ -10,10 +13,14 @@ public class MultiplesDeleter { * given an array of integers, named `ints` return an identical array with evens removed */ public Integer[] deleteEvens(Integer[] ints) { + List odd=new ArrayList<>(); + for(Integer num:ints){ + if(num%2==1){ + odd.add(num); + } + } - - - return null; + return odd.toArray(new Integer[0]); } /** @@ -22,7 +29,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; + + List even=new ArrayList<>(); + for(Integer num:ints){ + if(num%2==0){ + even.add(num); + } + } + return even.toArray(new Integer[0]); + //return null; } /** @@ -31,7 +46,15 @@ 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; + + List by3=new ArrayList<>(); + for(Integer num:ints){ + if(num%3!=0){ + by3.add(num); + } + } + return by3.toArray(new Integer[0]); + //return null; } /** @@ -41,6 +64,12 @@ 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; + List byn=new ArrayList<>(); + for(Integer num:ints){ + if(num%multiple!=0){ + byn.add(num); + } + } + return byn.toArray(new Integer[0]); } } From 39c3d4c874ff714c68610cf564bff7a358355f99 Mon Sep 17 00:00:00 2001 From: CITATS928 <93238522+CITATS928@users.noreply.github.com> Date: Mon, 8 Jul 2024 15:55:51 -0400 Subject: [PATCH 09/10] 6/70 --- .../assessment1/part2/ArrayUtils.java | 65 ++++++++++--------- .../assessment1/part2/StringUtils.java | 24 +++++-- 2 files changed, 55 insertions(+), 34 deletions(-) diff --git a/src/main/java/com/zipcodewilmington/assessment1/part2/ArrayUtils.java b/src/main/java/com/zipcodewilmington/assessment1/part2/ArrayUtils.java index 90e4afa..1992df6 100644 --- a/src/main/java/com/zipcodewilmington/assessment1/part2/ArrayUtils.java +++ b/src/main/java/com/zipcodewilmington/assessment1/part2/ArrayUtils.java @@ -1,8 +1,7 @@ package com.zipcodewilmington.assessment1.part2; import java.util.ArrayList; -import java.util.Arrays; -import java.util.LinkedList; +import java.util.List; /** * Created by leon on 2/16/18. @@ -33,27 +32,25 @@ public static Integer getNumberOfOccurrences(Object[] objectArray, Object object */ public static Object[] removeValue(Object[] objectArray, Object objectToRemove) { -// ArrayList arrayList= new ArrayList<>(); -// -// for(Object i:objectArray){ -// if(objectToRemove!=i){ -// arrayList.add(i); -// } -// } -// -// Object[] rrrrr = new Object[arrayList.size()]; -// for(int i=0;i< arrayList.size();i++){ -// rrrrr[i]= (Object) arrayList.get(i); -// } -// -// Object[] result1= new Object[arrayList.size()]; -// result1 = (Object[]) arrayList.toArray(); -// -// Object[] result= arrayList.toArray(); -// System.out.println(Arrays.toString(result)); -// -// return rrrrr; - return null; + ArrayList arrayList= new ArrayList<>(); + + for(Object i:objectArray){ + if(objectToRemove!=i){ + arrayList.add(i); + } + } + + Object[] rrrrr = new Object[arrayList.size()]; + for(int i=0;i< arrayList.size();i++){ + rrrrr[i]= (Object) arrayList.get(i); + } + + Object[] result1= new Object[0]; + + + return arrayList.toArray(new Object[0]); + //return result1; + } /** @@ -74,6 +71,8 @@ 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; } @@ -85,22 +84,30 @@ public static Object getLeastCommon(Object[] objectArray) { */ public static Object[] mergeArrays(Object[] objectArray, Object[] objectArrayToAdd) { Object[] result = new Object[objectArray.length+objectArrayToAdd.length]; - int length = objectArray.length+objectArrayToAdd.length;//12 - System.out.println(length); - + int length = objectArray.length+objectArrayToAdd.length;//12 + //System.out.println(length); for(int i=0;i<=objectArray.length-1;i++){ result[i]= objectArray[i]; - } for(int i=objectArray.length;i<=length-1;i++){ result[i]= objectArrayToAdd[i-objectArray.length]; } + //return result(new Object[0]); + //return null; + - return result; - //return null; + List neww = new ArrayList<>(); + for(int i=0;i Date: Tue, 9 Jul 2024 07:37:52 -0400 Subject: [PATCH 10/10] fixed --- .DS_Store | Bin 0 -> 6148 bytes src/.DS_Store | Bin 0 -> 6148 bytes src/main/.DS_Store | Bin 0 -> 6148 bytes src/main/java/.DS_Store | Bin 0 -> 6148 bytes src/main/java/com/.DS_Store | Bin 0 -> 6148 bytes src/main/java/com/zipcodewilmington/.DS_Store | Bin 0 -> 6148 bytes .../zipcodewilmington/assessment1/.DS_Store | Bin 0 -> 6148 bytes .../assessment1/part2/ArrayUtils.java | 94 +++++++++++------- 8 files changed, 56 insertions(+), 38 deletions(-) create mode 100644 .DS_Store create mode 100644 src/.DS_Store create mode 100644 src/main/.DS_Store create mode 100644 src/main/java/.DS_Store create mode 100644 src/main/java/com/.DS_Store create mode 100644 src/main/java/com/zipcodewilmington/.DS_Store create mode 100644 src/main/java/com/zipcodewilmington/assessment1/.DS_Store diff --git a/.DS_Store b/.DS_Store new file mode 100644 index 0000000000000000000000000000000000000000..4b6c0659a087a7a74a38f2d7bfd41ada3a1549b6 GIT binary patch literal 6148 zcmeHK-AcnS6i&A3I)=~-1@S82?Z9=g!SJTk`2tq-LS?pgXt6eww?hWI4;&L%96@{Yjh`{r)F!G+R5nZL4i{tvmloF8v}X7P%K>H)vf-nS_-dgjexw zIkorCWLgAqI?Gf+9L*r*_Bu`@x%A{BjdE4%>wwj2vau$~R3Y2fmf;8LZ$P6tkXJKT8vtK7yypuCfS;0b+m{AO^OX z0dp!?-EAg;)=mr%1GNm`{ve<=_`4&ox+T)a8t;nPD6=bM<)PYIg7omCm@Uk$Pf)7}#W>sZATt|8w|dY9INV zC1eo;#K1pefVU?8#Dhhdv-QXF@T?Wk?xCSzUWp0_=o^;+FmN9^R6!jVs6(D>u+)g7 TpkI{((nUZKLLD*i3k-Y#fE!8t literal 0 HcmV?d00001 diff --git a/src/.DS_Store b/src/.DS_Store new file mode 100644 index 0000000000000000000000000000000000000000..1d2d81f86c2eb315f8ac59818a1ca3c3de819f18 GIT binary patch literal 6148 zcmeHK-AcnS6i&A4I)=~-1@S82?Z9=g!SJTk`2tq-LS?peXt8U?+PRA{=mY2r`5-=z z=On2(oVOzG97w+Nn=~IZKa4T%&tsP{hcRYDL*%Gz5Oi-0)l4!X$1$QsK8;ctf&FG; ze;x4KEjD2xOIY^x`=e=^BZk~dF+dFb$N=sS0ve)cu+*rw4(RaujByJQ1$2B%APR$?!BQhcK)5ai z)TP`!F}N-Vzc6{8!BV3xXI#w;bO81@;rm3 VMjQqGsvM9m0*Vmoh=E^V-~%;zO1}UA literal 0 HcmV?d00001 diff --git a/src/main/.DS_Store b/src/main/.DS_Store new file mode 100644 index 0000000000000000000000000000000000000000..507c0e13a6f988482c5f8d83a341dbaa52b0f96f GIT binary patch literal 6148 zcmeHK-AcnS6i(c99Yg4af_N41cHlbLV0csNd;u$Zp)y-Kv|5|7cI(9$^a1pRd=Q_< zbCOgX&RY?84kX|CO_~pyAI2E>W|6~~%^0(wA#zmK2)fsXwoEc2$1%bpn}mrB!G1Hb zzYh5Ab@s>tHfO=t?++(QoaLR)JKw6+w|5#=!)jT#{(~(1JjiF67fi3wx{xvnD?JD= z<8d*v_fBP+2XQ){s)9HgL(0unoJO+nwwj^+7tVDwHiA8u5kLJ;kqkUPH!;k ziosyCUbn5olhd=y$xAXz<(npy1K&#a4OZ|DidoOAzep3AK7psouCfS;0b+m{AO^OX z0dp!?ooyz8)=mr%1GNm`{ve<=_`4&ox+T)a8t;nPD6=bM<)PYIg7omCm@Uk$Pf)7}#W>p-mgl{|oqKY9INV zC1eo;#K1pefH%kf*n>rxv-QXF@T?Wk9-yIMUWp0_=o^;+FmN9^Qb8RTs6(D>u+)g7 TpkI{((nUZKLLD*i3k-Y#>GMhI literal 0 HcmV?d00001 diff --git a/src/main/java/com/.DS_Store b/src/main/java/com/.DS_Store new file mode 100644 index 0000000000000000000000000000000000000000..f9aff1231144fb6cdbaa924c2c9055c8fc46b59b GIT binary patch literal 6148 zcmeHK!Ab)$5S`R&w}?<8!%`5}If zGf65+6+DPYnSsfhOlA`DvSc;@Alj3t4p0FA50$V`#^wv5anc1TI1iyPb7+X54;jRe zEJU;8KQcgPw+WAUVneurkLNc)pMqOR(W}C2JPZ>ZV)RQmOyY4`tG$ZCN^y0qm;1pz3?pVXWh!ykydFhR{fDlh@(D+T%N}&(pg(iR5UiZ zfgSM5Ub$P@olXzxjjF6SS_iYLoYrg2R#i5et=X*XZSUa>1I)lLGC=o(L?!ec<`&J> zfermW(s+@O1Z{dt5K4!>!`vc{pa`3aXj6rIVhEd#e(B%eue!SJQb`3J1%gUW2#&|=rf+PQ}@=nv38V@!Y|Rvc)45FAHclZy2qa{Y~rWo*L6 zEM@sxG&%kw1Gsk$7Q((|uy5b@&x_{SbCjqEBHp9tB+l|y>w{OSwVmC%sEdZU3m(-x z$isY=^~326_AZr5qS6kdt9U#gy8CA;&BHhyPjx~(8biqKb)1gWysu{IDAT!t84!+e zhVIc~(e>I*>9u>^Wm7J^R;SmLolbALbi~2&$?3)LDVe0|)sV{J|I@N(v4l4;HmvU@ zn5KzJA0VR4F0%-U0b+m{*lq^wsV5rSy-ZpiF+dFbf&n}qBq*Y9u`sBQ4ruWDh~qUx z6tM9vfhaBd77K$g0>Vuyph@NSiNQ@e_@#~WEfxk%I^%j~_>P^K+ZPJgvx8siaK?Ru z)Di>4z$yb(({-`_pKpHuuO?BC7$63=iUD351cN>-$=24j#bK?Lp!c9C7*`nlN&!Qc gVu;03d-Bflj9@Qlx>gWY4b8 zv#Xopd^R&*f9!9~R%W(@6YY~>YJ5(g*hOWC9%tO`-*$)X@pzcj&LzmbvKM={S9`Y+ z|2KVq^09N*DK7=2fE17dQsCb!fSyfTUMDI_0VyB_eiY#Mp}~p0a7c_#2SSVhzy;D_ zSjQ{@Y)k-q;gE<7%##XCs@I6&Nk_g_T`wFGlWrb2nS3P^#m z0++d6vHw57XXgJgNjoVZ1^$!*zSul&)_A4rt&^8yuWj%rIBUM(G^~Sy5bYQk?HC)j e arrayList= new ArrayList<>(); - - for(Object i:objectArray){ + ArrayList arrayList= new ArrayList<>(); + for(Integer i:objectArray){ if(objectToRemove!=i){ arrayList.add(i); } } - - Object[] rrrrr = new Object[arrayList.size()]; - for(int i=0;i< arrayList.size();i++){ - rrrrr[i]= (Object) arrayList.get(i); - } - - Object[] result1= new Object[0]; - - - return arrayList.toArray(new Object[0]); - //return result1; + return arrayList.toArray(new Integer[0]); } @@ -62,6 +51,24 @@ public static Object getMostCommon(Object[] objectArray) { return null; + + /* + Map countMap = new HashMap<>(); + int mostFrequent = (int) objectArray[0]; + int maxCount = 0; + + for (int i = 0; i < objectArray.length; i++) { + int num = (int) objectArray[i]; + int count = countMap.getOrDefault(num, 0) + 1; + countMap.put(num, count); + + if (count > maxCount) { + mostFrequent = num; + maxCount = count; + } + } + return mostFrequent; + */ } @@ -74,6 +81,34 @@ public static Object getLeastCommon(Object[] objectArray) { return null; + + + /* + int n = objectArray.length; + boolean visited[] = new boolean[n]; + int maxFreq = 0, minFreq = n; + int maxElement = 0, minElement = 0; + for (int i = 0; i < n; i++) { + if (visited[i] == true) + continue; + int count = 1; + for (int j = i + 1; j < n; j++) { + if (objectArray[i] == objectArray[j]) { + visited[j] = true; + count++; + } + } + if (count > maxFreq) { + maxElement = objectArray[i]; + maxFreq = count; + } + if (count < minFreq) { + minElement = objectArray[i]; + minFreq = count; + } + } + return minElement; + */ } /** @@ -83,31 +118,14 @@ 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) { - Object[] result = new Object[objectArray.length+objectArrayToAdd.length]; + int x = objectArray.length; + int y = objectArrayToAdd.length; + Integer[] mergeArray = new Integer[x + y]; - int length = objectArray.length+objectArrayToAdd.length;//12 //System.out.println(length); + System.arraycopy(objectArray, 0, mergeArray, 0, x); + System.arraycopy(objectArrayToAdd, 0, mergeArray, x, y); - for(int i=0;i<=objectArray.length-1;i++){ - result[i]= objectArray[i]; - } - for(int i=objectArray.length;i<=length-1;i++){ - result[i]= objectArrayToAdd[i-objectArray.length]; - } - - //return result(new Object[0]); - //return null; - - - - List neww = new ArrayList<>(); - for(int i=0;i