Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

All test cases evaluate to true #57

Open
wants to merge 2 commits into
base: master
Choose a base branch
from
Open
Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension


Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
12 changes: 12 additions & 0 deletions pom.xml
Original file line number Diff line number Diff line change
Expand Up @@ -7,6 +7,18 @@
<groupId>com.zipcodewilmington.labs</groupId>
<artifactId>arrayutils</artifactId>
<version>1.0-SNAPSHOT</version>
<build>
<plugins>
<plugin>
<groupId>org.apache.maven.plugins</groupId>
<artifactId>maven-compiler-plugin</artifactId>
<configuration>
<source>8</source>
<target>8</target>
</configuration>
</plugin>
</plugins>
</build>
<dependencies>
<dependency>
<groupId>junit</groupId>
Expand Down
78 changes: 68 additions & 10 deletions src/main/java/com/zipcodewilmington/StringArrayUtils.java
Original file line number Diff line number Diff line change
@@ -1,5 +1,7 @@
package com.zipcodewilmington;

import java.util.*;

/**
* Created by leon on 1/29/18.
*/
Expand All @@ -25,15 +27,15 @@ public static String getSecondElement(String[] array) {
* @return last element in specified array
*/ // TODO
public static String getLastElement(String[] array) {
return null;
return array[array.length - 1];
}

/**
* @param array array of String objects
* @return second to last element in specified array
*/ // TODO
public static String getSecondToLastElement(String[] array) {
return null;
return array[array.length - 2];
}

/**
Expand All @@ -42,31 +44,49 @@ public static String getSecondToLastElement(String[] array) {
* @return true if the array contains the specified `value`
*/ // TODO
public static boolean contains(String[] array, String value) {
return false;
List<String> arrayList = new ArrayList<>(Arrays.asList(array));
return arrayList.contains(value);
}

/**
* @param array of String objects
* @return an array with identical contents in reverse order
*/ // TODO
public static String[] reverse(String[] array) {
return null;
String[] reversedArray = new String[array.length];
int j = array.length - 1;
for(int i = 0; i < array.length; i++){
reversedArray[j--] = array[i];
}
return reversedArray;
}

/**
* @param array array of String objects
* @return true if the order of the array is the same backwards and forwards
*/ // TODO
public static boolean isPalindromic(String[] array) {
return false;
int midPoint = array.length / 2;
int lastIndex = array.length - 1;
for(int i = 0; i < midPoint; i++){
if(!array[i].equals(array[lastIndex - i])) return false;
}
return true;
}

/**
* @param array array of String objects
* @return true if each letter in the alphabet has been used in the array
*/ // TODO
public static boolean isPangramic(String[] array) {
return false;
String alphabet = "abcdefghijklmnopqrstuvwxyz";
List<String> arrayList = new ArrayList<>(Arrays.asList(array));
String allContents = arrayList.toString();
allContents = allContents.replaceAll(",", "").replaceAll(" ", "").toLowerCase(Locale.ROOT);
for(int i = 0; i < alphabet.length(); i++){
if(allContents.indexOf(alphabet.charAt(i)) == -1) return false;
}
return true;
}

/**
Expand All @@ -75,7 +95,13 @@ public static boolean isPangramic(String[] array) {
* @return number of occurrences the specified `value` has occurred
*/ // TODO
public static int getNumberOfOccurrences(String[] array, String value) {
return 0;
int count = 0;
for(String element : array){
if(element == value){
count++;
}
}
return count;
}

/**
Expand All @@ -84,23 +110,55 @@ public static int getNumberOfOccurrences(String[] array, String value) {
* @return array with identical contents excluding values of `value`
*/ // TODO
public static String[] removeValue(String[] array, String valueToRemove) {
return null;
ArrayList<String> arrayList = new ArrayList<>();
Collections.addAll(arrayList, array);
while(arrayList.contains(valueToRemove)){
arrayList.remove(valueToRemove);
}
return arrayList.toArray(new String[0]);
}

/**
* @param array array of chars
* @return array of Strings with consecutive duplicates removes
*/ // TODO
public static String[] removeConsecutiveDuplicates(String[] array) {
return null;
ArrayList<String> arrayList = new ArrayList<>();
String lastElement = "";
for(String element : array){
if(element != lastElement){
arrayList.add(element);
}
lastElement = element;
}
return arrayList.toArray(new String[0]);
}

/**
* @param array array of chars
* @return array of Strings with each consecutive duplicate occurrence concatenated as a single string in an array of Strings
*/ // TODO

/*
String[] array = {"a", "a", "a", "b", "c", "c", "a", "a", "d"}; arrayList has 1 position, and it's an a.
String[] expected = {"aaa", "b", "cc", "aa", "d"};

*/
public static String[] packConsecutiveDuplicates(String[] array) {
return null;
int length = array.length;
int lastIndex = 0;
ArrayList<String> arrayList = new ArrayList<>();
arrayList.add(array[0]);

for(int i = 1; i < length; i++){
if(arrayList.get(lastIndex).contains(array[i])){ //does my arrayList, at the last examined index contain what the array current shows
arrayList.set(lastIndex, (arrayList.get(lastIndex) + array[i])); //arrayList.set(index, value)
} else { //no longer looking at a consecutive
lastIndex++; //I'm looking at a new 0R non-duplicate character
arrayList.add(array[i]);
}
}
return arrayList.toArray(new String[0]);
}


Expand Down