update codewars

Author: ecmagnuson

Java/Codewars/bin/.gitignore

@@ -1,2 +1,5 @@
 /HashSandbox.class
 /Conversion2.class
+/ConversionComments.class
+/JadenCase.class
+/Kata.class

Java/Codewars/bin/Conversion.class

@@ -39,7 +39,7 @@ public String solution(int n) {
 
 	public static void main(String[] args) {
 		Conversion c = new Conversion();
-		System.out.println(c.solution(501));
+		System.out.println(c.solution(539));
 	}
 
 }

Java/Codewars/src/Conversion.java

@@ -37,6 +37,11 @@ public String solution(int n) {
 		 * X Likewise, if it was 25, still find 10. The TreeMap with NavgableMap has the
 		 * method floorKey to do this so it made it much easier to accomplish this..
 		 */
+		/*
+		 * This was my first time using and learning about this data structure. It's
+		 * very neat. I think we spoke about it when we spoke about it implementation as
+		 * a red black BST
+		 */
 		while (digitsLeft != 0) {
 			digitsLeft = n - rns.floorKey(n);
 			currentFloorKey = rns.floorKey(n);

Java/Codewars/src/ConversionComments.java

@@ -0,0 +1,11 @@
+import java.util.Arrays;
+
+public class Kata {
+
+	public static String highAndLow(String numbers) {
+		int[] nums = Arrays.stream(numbers.split(" ")).mapToInt(Integer::parseInt).toArray();
+		Arrays.sort(nums);
+		return String.valueOf(nums[nums.length - 1]) +  " " + String.valueOf(nums[0]);
+	}
+
+}