Merge b03f8f4a055ffb66886bfa40c53473877c46b892 into b2e20fd406b12d4908e4fb952d821a476dd96c45

.idea/compiler.xml

@@ -0,0 +1,16 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<project version="4">
+  <component name="CompilerConfiguration">
+    <annotationProcessing>
+      <profile name="Maven default annotation processors profile" enabled="true">
+        <sourceOutputDir name="target/generated-sources/annotations" />
+        <sourceTestOutputDir name="target/generated-test-sources/test-annotations" />
+        <outputRelativeToContentRoot value="true" />
+        <module name="FundamentalDrills-Part1" />
+      </profile>
+    </annotationProcessing>
+    <bytecodeTargetLevel>
+      <module name="FundamentalDrills-Part1" target="1.5" />
+    </bytecodeTargetLevel>
+  </component>
+</project>

.idea/misc.xml

@@ -0,0 +1,13 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<project version="4">
+  <component name="MavenProjectsManager">
+    <option name="originalFiles">
+      <list>
+        <option value="$PROJECT_DIR$/pom.xml" />
+      </list>
+    </option>
+  </component>
+  <component name="ProjectRootManager" version="2" languageLevel="JDK_1_8" project-jdk-name="1.8" project-jdk-type="JavaSDK">
+    <output url="file://$PROJECT_DIR$/classes" />
+  </component>
+</project>

.idea/modules.xml

@@ -0,0 +1,8 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<project version="4">
+  <component name="ProjectModuleManager">
+    <modules>
+      <module fileurl="file://$PROJECT_DIR$/FundamentalDrills-Part1.iml" filepath="$PROJECT_DIR$/FundamentalDrills-Part1.iml" />
+    </modules>
+  </component>
+</project>

.idea/vcs.xml

@@ -0,0 +1,6 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<project version="4">
+  <component name="VcsDirectoryMappings">
+    <mapping directory="$PROJECT_DIR$" vcs="Git" />
+  </component>
+</project>

FundamentalDrills-Part1.iml

@@ -0,0 +1,16 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<module org.jetbrains.idea.maven.project.MavenProjectsManager.isMavenModule="true" type="JAVA_MODULE" version="4">
+  <component name="NewModuleRootManager" LANGUAGE_LEVEL="JDK_1_5">
+    <output url="file://$MODULE_DIR$/target/classes" />
+    <output-test url="file://$MODULE_DIR$/target/test-classes" />
+    <content url="file://$MODULE_DIR$">
+      <sourceFolder url="file://$MODULE_DIR$/src/main/java" isTestSource="false" />
+      <sourceFolder url="file://$MODULE_DIR$/src/test/java" isTestSource="true" />
+      <excludeFolder url="file://$MODULE_DIR$/target" />
+    </content>
+    <orderEntry type="inheritedJdk" />
+    <orderEntry type="sourceFolder" forTests="false" />
+    <orderEntry type="library" scope="TEST" name="Maven: junit:junit:4.12" level="project" />
+    <orderEntry type="library" scope="TEST" name="Maven: org.hamcrest:hamcrest-core:1.3" level="project" />
+  </component>
+</module>

src/main/java/io/zipcoder/ArrayDrills.java

@@ -1,5 +1,7 @@
 package io.zipcoder;
 
+import java.util.Arrays;
+
 public class ArrayDrills {
 
 
@@ -7,19 +9,32 @@ public class ArrayDrills {
      * Given an array of ints, return true if value appears as either the first or last element in the array.
      * The array will be length 1 or more.
      * example : firstLast(6, [1,2,6); // Should return true
-     *           firstLast(6, [1,2,3]); // Should return false
+     * firstLast(6, [1,2,3]); // Should return false
      */
-    public Boolean firstLast(Integer value, Integer[] input){
-        return null;
+    public Boolean firstLast(Integer value, Integer[] input) {
+        Integer number = value;
+        Integer[] enter = input;
+        Integer last = enter[enter.length - 1];
+        if (value.equals(enter[0]) || value.equals(last)) {
+            return true;
+        }
+
+        return false;
     }
 
     /**
      * Given an array of ints, return true if the array is length 1 or more, and the first element and the last element are equal.
      * example : sameFirstLast([1,2,3]); // Should return false
-     *           sameFirstLast([1,2,1]); // Should return true
+     * sameFirstLast([1,2,1]); // Should return true
      */
-    public Boolean sameFirstLast(Integer[] input){
-        return null;
+    public Boolean sameFirstLast(Integer[] input) {
+        Integer[] enter = input;
+        Integer last = enter[enter.length - 1];
+        if (enter[0] == last) {
+
+            return true;
+        }
+        return false;
     }
 
 
@@ -27,60 +42,114 @@ public class ArrayDrills {
      * Given 2 arrays of ints, a and b, return true if they have the same first element or they have the same last element.
      * Both arrays will be length 1 or more.
      * example : commonEnd([1, 2, 3], [7, 3]); // Should return true
-     *           commonEnd([1, 2, 3], [7, 3, 2]); // Should return false
+     * commonEnd([1, 2, 3], [7, 3, 2]); // Should return false
      */
-    public Boolean commonEnd(Integer[] input1, Integer[] input2){
-        return null;
-    }
+    public Boolean commonEnd(Integer[] input1, Integer[] input2) {
+        Integer[] a = input1;
+        Integer[] b = input2;
+        Integer lasta = a[a.length - 1];
+        Integer lastb = b[b.length - 1];
 
-    /**
-     * Given an array of ints, return an array with the elements "rotated left" so {1, 2, 3} yields {2, 3, 1}.
-     * example : rotateLeft([1, 2, 3]); // Should return [2,3,1]
-     *           rotateLeft([5, 11, 9]); // Should return [11,9,5]
-     */
-    public Integer[] rotateLeft(Integer[] input){
-        return null;
-    }
+        if (a[0] == b[0]) {
+            return true;
+        }
+               else if (lasta == lastb) {
+                    return true;
+                }
 
+                    return false;
+            }
 
-    /**
-     * Given an array of ints, figure out which is element in the array is largest,
-     * and set all the other elements to be that value. Return the changed array.
-     * example : maxValue([1, 2, 3]); // Should return [3,3,3]
-     *           maxValue([5, 11, 9]); // Should return [11,11,11]
-     */
-    public Integer[] maxValue(Integer[] input){
-        return null;
-    }
 
 
-    /**
-     * Given 2 int arrays, a and b, return a new array length 2 containing their middle elements, if length is odd.
-     * If the array length is even the sum of the middle 2 elements in the array.
-     * example : middleWay([1, 2, 3], [4,5,6,2]); // Should return [2,11]
-     *           middleWay([5, 1, 2, 9], [3, 4, 5, 5]); // Should return [3, 9]
-     */
-    public Integer[] middleWay(Integer[] input1, Integer[] input2){
-        return null;
-    }
 
+        /**
+         * Given an array of ints, return an array with the elements "rotated left" so {1, 2, 3} yields {2, 3, 1}.
+         * example : rotateLeft([1, 2, 3]); // Should return [2,3,1]
+         *           rotateLeft([5, 11, 9]); // Should return [11,9,5]
+         */
 
-    /**
-     * Start with 2 int arrays, a and b, each length 2.
-     * Consider the sum of the values in each array.
-     * Return the array which has the largest sum. In event of a tie, return a.
-     */
-    public Integer[] biggerTwo(Integer[] a, Integer[] b){
-        return null;
-    }
+        public Integer[] rotateLeft (Integer[]input) {
+            Integer[] enter = new Integer[input.length];
+            for (Integer i = 0; i < enter.length; i++) {
+                enter[i] = input[i + 1];
+                }
+            return enter;
+        }
+
+        /**
+         * Given an array of ints, figure out which is element in the array is largest,
+         * and set all the other elements to be that value. Return the changed array.
+         * example : maxValue([1, 2, 3]); // Should return [3,3,3]
+         *           maxValue([5, 11, 9]); // Should return [11,11,11]
+         */
+        public Integer[] maxValue (Integer[]input){
+            Integer maxValue = input[0];
+            for(Integer i = 0; i < input.length; i++){
+                if(input[i] > maxValue){
+                    maxValue = input[i];
+
+                }
+            }
+            Integer[]outPut =new Integer[input.length];
+            for(int j=0;j<input.length;j++){
+                outPut[j]=maxValue;
+            }
+            return outPut;
+        }
+
+
+        /**
+         * Given 2 int arrays, a and b, return a new array length 2 containing their middle elements, if length is odd.
+         * If the array length is even the sum of the middle 2 elements in the array.
+         * example : middleWay([1, 2, 3], [4,5,6,2]); // Should return [2,11]
+         *           middleWay([5, 1, 2, 9], [3, 4, 5, 5]); // Should return [3, 9]
+         */
+        public Integer[] middleWay (Integer[]input1, Integer[]input2){
+            Integer [] newArray = new Integer[2];
+            if(input1.length % 2 == 0){
+                newArray[0] = input1[input1.length / 2] + input1[input1.length / 2 - 1];
+                }
+            if(input2.length % 2 == 0){
+                newArray[1] = input2[input2.length / 2] + input2[input2.length / 2 -1];}{
+                }
+                if(input1.length % 2 == 1){
+                    newArray[0] = input1[input1.length / 2];
+                }
+                if(input2.length % 2 == 1){ newArray[1] = input2[input2.length / 2];
+            }
+            return newArray;
+        }
+
+
+
+        /**
+         * Start with 2 int arrays, a and b, each length 2.
+         * Consider the sum of the values in each array.
+         * Return the array which has the largest sum. In event of a tie, return a.
+         */
+        public Integer[] biggerTwo (Integer[]a, Integer[]b){
+            Integer suma = a[0] + a[1];
+            Integer sumb = b[0] + b[1];
+            if(suma > sumb)
+            return a;
+            {
+                return b;
+            }
+        }
+
+        /**
+         * Given an array of ints of odd length, return a new array length 3 containing the elements from the middle of the array.
+         * The array length will be at least 3.
+         * example : midThree([1, 2, 3, 4, 5]); // Should return [2, 3, 4]
+         *           midThree([8, 6, 7, 5, 3, 0, 9]); // Should return [7, 5, 3]
+         */
+        public Integer[] midThree (Integer[]nums){
+                    Integer[] newArray = new Integer[3];
+            newArray[0] = nums[nums.length / 2 - 1];
+            newArray[1] = nums[nums.length / 2];
+            newArray[2] = nums[nums.length / 2 + 1];
+            return newArray;
+        }
 
-    /**
-     * Given an array of ints of odd length, return a new array length 3 containing the elements from the middle of the array.
-     * The array length will be at least 3.
-     * example : midThree([1, 2, 3, 4, 5]); // Should return [2, 3, 4]
-     *           midThree([8, 6, 7, 5, 3, 0, 9]); // Should return [7, 5, 3]
-     */
-    public Integer[] midThree(Integer[] nums){
-        return null;
-    }
 }

src/test/java/io/zipcoder/ArrayDrillsTest.java

@@ -177,7 +177,7 @@ public class ArrayDrillsTest {
 
     @Test
     public void biggerTwo3(){
-        Integer[] inputArray1 = {-1 ,20};
+        Integer[] inputArray1 = {1 ,20};
         Integer[] inputArray2 = {2, 15};
         Integer[] expected = {1,20};
         Integer[] actual = arrayDrills.biggerTwo(inputArray1, inputArray2);