From da55838a8ebb284f45f2e93814c0df9c2b2b593f Mon Sep 17 00:00:00 2001
From: KylerSmith <Kyler@macBookAir.local>
Date: Fri, 7 Jul 2017 18:12:14 -0700
Subject: [PATCH 1/3] Count character algo added

---
 CountChar.java | 42 ++++++++++++++++++++++++++++++++++++++++++
 1 file changed, 42 insertions(+)
 create mode 100644 CountChar.java

diff --git a/CountChar.java b/CountChar.java
new file mode 100644
index 000000000000..dfdc0684d201
--- /dev/null
+++ b/CountChar.java
@@ -0,0 +1,42 @@
+import java.util.Scanner;
+
+
+/**
+ * @author Kyler Smith, 2017
+ *
+ * Implementation of a character count.
+ * (Slow, could be improved upon, effectively O(n).
+ * */
+
+public class CountChar {
+
+    public static void main(String[] args) {
+  	  	Scanner input = new Scanner(System.in);
+  	  	System.out.print("Enter your text: ");
+      	String str = input.nextLine();
+
+        System.out.println("There are " + CountCharacters(str) + " characters.");
+    }
+
+
+
+    /**
+     * @param str: String to count the characters
+     *
+     * @return int: Number of characters in the passed string
+     * */
+
+    public static int CountCharacters(String str) {
+
+    	int count = 0;
+
+    	if(str.isEmpty() || str == null)
+    		return -1;
+
+        for(int i = 0; i < str.length(); i++)
+        	if(!Character.isWhitespace(str.charAt(i)))
+        		count++;
+
+        return count;
+     }
+}

From 1af3806a881e20e6b84cb1d7dfd36603029bd154 Mon Sep 17 00:00:00 2001
From: KylerSmith <Kyler@macBookAir.local>
Date: Fri, 7 Jul 2017 18:24:45 -0700
Subject: [PATCH 2/3] Clean up FloydTriangle (ft.java)

---
 .DS_Store | Bin 8196 -> 6148 bytes
 ft.java   |  32 +++++++++++++++-----------------
 2 files changed, 15 insertions(+), 17 deletions(-)

diff --git a/.DS_Store b/.DS_Store
index 27875fa6e0825fbffd3779ceb1765c6599a40067..4510cdaa3c92eed37289c2ac12b58a82591e3985 100644
GIT binary patch
delta 139
zcmZp1XfcprU|?W$DortDU=RQ@Ie-{MGjUEV6q~50D9Q$s2aA<3lr!Wr6fvYQ6mKkC
z&dA6%`Hn#S<d1^uCf^h`+E_M+WidMkhafXhJrD?R0|{4<IU5VVGf(E1aRgZeGKmF5
PGeK+ui*1hQnZpbK${823

literal 8196
zcmeI0UvASt5XQf415JgXB~eiy{n)2U+`vRBq7s#$JwThpB?QtKB@UD~AESrj033l^
zgl}fIt<%I#UkXUfMmrPPJAd}KySByvTx*)V1a<+`*+p+Zp;*%7zVwB*7Opg?9qoZJ
zz9Yg3&e2&IZ5NDy5ikNqzz7(De}Mqs+0yDI?|pyQq!BOz|0Mx=K1A%I<Dhe|_0d70
zB>;7em$mUf>j1Thf{ugEy;f8D^won4rY@8i&YSaoB*UrWpmVRiIh;3#3z1!@P@G1m
zU8KX|Vy{ga0VA+TKx+2}S{Pu&n!Q-RkI}<N?Bf%!e?{kTnD)BEw9D~w#9p)S&9w0!
z@Zye-3@J}=n_mKY^nF1e!%|;Acw8^(V{JB5U)%IGMVG%J?d5wy%FMDV`?*}U7&E1Z
z5pBMyZGuUewfh;OZ-nSuNSJNLeoCv1k*D;RQI46-WS)aNX2$az=I0#IQb-gDS1?r$
zE@ZNEhu^iYRP(7IDp{$g_2B6l*Q=veLUK^G8o~p6?2m$NgSN6e5|w?tQx6xyqKv8T
zj;q4%*uV#JSUPV%>RRghKgAn*@8HY5R=yagi9=>Op|$Ln0m+Y6?;oLsqL=4*t8<kc
z#^GyL<!Ml6SM*Z5;eDhz^eI>EUY;a<d2Qa<zUN*WaJ4>jCM$Qos~0$L;ur^b#eH)`
zz0Y%(Ebdp0_Bcdqa)#$T-$G2dMU=AVWySl;SB&$NoPSX>HYLzhN^)A|q}-RgoV?rY
z{R`aQ{|eNE5qNL{>psG+)c*(N-~S&x4+~%fjKJR`;A-uYc8l>{Ne)tLN9<?p(qvrj
mwVF_9IZmzRICUt;b!^0;ViO0Qd(A6s_8~wqm@oo=l)!I7Fc)M1

diff --git a/ft.java b/ft.java
index 843f4a559bde..815dbd292ec7 100644
--- a/ft.java
+++ b/ft.java
@@ -1,19 +1,17 @@
 import java.util.Scanner;
-  class FloydTriangle
-  {
-  public static void main(String[] args)
-  {
-Scanner sc = new Scanner(System.in);
-System.out.println("Enter the number of rows which you want in your Floyd Triangle: ");
-int r = sc.nextInt();
-int n=0;
-for(int i=0; i&lt;r; i++)
-{
-for(int j=0; j&lt;=i; j++)
-{
-System.out.print(++n+" ");
+
+
+class FloydTriangle {
+    public static void main(String[] args) {
+          Scanner sc = new Scanner(System.in);
+          System.out.println("Enter the number of rows which you want in your Floyd Triangle: ");
+          int r = sc.nextInt(), n = 0;
+
+          for(int i=0; i < r; i++) {
+              for(int j=0; j <= i; j++) {
+                  System.out.print(++n + " ");
+              }
+              System.out.println();
+          }
+      }
 }
-System.out.println();
-}
-}
-}
\ No newline at end of file

From 5fec65b24781cf2b882e60853375b230fc2a670a Mon Sep 17 00:00:00 2001
From: KylerSmith <Kyler@macBookAir.local>
Date: Sat, 8 Jul 2017 20:10:43 -0700
Subject: [PATCH 3/3] Create Matrix data structure.

---
 .DS_Store                          | Bin 6148 -> 8196 bytes
 data_structures/Matrix/Matrix.java | 197 +++++++++++++++++++++++++++++
 2 files changed, 197 insertions(+)
 create mode 100644 data_structures/Matrix/Matrix.java

diff --git a/.DS_Store b/.DS_Store
index 4510cdaa3c92eed37289c2ac12b58a82591e3985..f28585d78e4c824a62c4e8ee30d752891efb7b22 100644
GIT binary patch
literal 8196
zcmeHM-A)rh6h6a`Y(oSBCU9l;#>5LkAVdi<Cbbk3E{uc{y-)+&?%J+ycgc23#ah!F
z-vJ-NH}MU85FbFlGc(|J>lQDFL7Yiu&g|~_&YAtr{Pb*zNR-;{8qpFFS*R@MrqTSS
z@N=$1WlY~;umGOu4LNj7&Q1{3hP2HM!+>GHFkl!k3>XHk0s}a+xmY>pzItj}!+>Gn
zzhr>-2OE`TQOmxPa_c}NQvk>b+?EA><N*?6YgyE?ucU;+rpg|Kh6<fx2nEM;o7EwU
zTK1Jxa1shmLVFfELlM$DaJEz@QB=~jh5^ICFazoXK$Tuoi&oP4do_rvP{(o-pHQtI
zvPc8dv_%nx$n-smf%D~6i?jY;DEb23yBDLXoz{^?eXSk^ek)mB{U*l7Cnj%9S%rdC
zxM{trG@?!=aguhc<is!JmG630-QSO*;JoitpZQ+rVD8pd6ef-zdT~nq<#RuDqfRMm
zhi*&S*>#czu+q`N++w%8zP`R}Z`|uG+uhAgbnkDj^?H`IcxUb5&SCT9efLA}<Ef%i
z=&gum)%AJ%8ND2ijw^8(L}48ojGmE9w!vkBUISlG;@l`KLjN?y=PcF0yTW$Ri^<K8
zp^U~L+J(0S^#G^@=r-&nXk$b*6HCFq)3Ka|uMy~L8q*8jIuqLkDuc-yR!0+D1+<SC
zJ(V2u)rhq=5M>KYk6N4GGqYj_UVW_Nw}@&(#?{I5MGrFTdWIfjq&y3FHu-YYdE;ci
z=@~H(tdDu@%C=6s(n6Ex(kTA}@45gR0eqjp%Dx^!NOj!vV50`<z*=T*^2{FCou<H7
zlIK%k+ymP4V2a<B*$QF5DOW&(tCKt%lDBuMl~|xX+NMWf{t4s?Y`DXFp-3Zc!>0$m
zNbaF!_&mbf`FKZORUUYV@vKP|8A0Z?o;Mm^o0&J-gN3ub+4~b4LmXN_c^FHK5jD`u
zaLy;fK=db}&vPcpYBE=On%8ufNO6(b5kSS2D&uN2OPv32=YRjdQe!rQF$@?6E|&o@
zQLdCruzB`_Hfx@9Z5#Cvl?&_jm6Q-PG98DM={V&1ABO1LP-RR}%f6DhgYx%31Y}N2
QbN-V#|1UA~`$x|IpZ9>FN&o-=

delta 206
zcmZp1XfcprU|?W$DortDU=RQ@Ie-{MGjUEV6q~50D9Q$s2aA<3lr!Wr6fvYQ6mKkC
z&dA6%`H-Li7vl|}d<9Su`{X}@rmR6gmd0cr5pzzUID-ZdvrhIAv1WAxvSv)aB%;Rg
z9||VBi0be#0@X8u>}31@e`Dc7mc{HG9D>Y1J`f0S0|{4<Q#KZUXP(S2;|Ovq$T2J+
PnhD}qu-N8!o;l0_TkI$~

diff --git a/data_structures/Matrix/Matrix.java b/data_structures/Matrix/Matrix.java
new file mode 100644
index 000000000000..652a4e83b791
--- /dev/null
+++ b/data_structures/Matrix/Matrix.java
@@ -0,0 +1,197 @@
+/**
+* Matrix data-type.
+*
+* @author Kyler Smith, 2017
+*/
+
+
+public class Matrix {
+
+	public static void main(String[] args) {
+
+		int[][] data1 = new int[0][0];
+        int[][] data2 = {{1, 2, 3}, {4, 5, 6}, {7, 8, 9}};
+        int[][] data3 = {{1, 4, 7}, {2, 5, 8}, {3, 6, 9}};
+
+        Matrix m1 = new Matrix(data1);
+        Matrix m2 = new Matrix(data2);
+        Matrix m3 = new Matrix(data3);
+
+        System.out.println("m1 --> Rows: " + m1.getRows() + " Columns: " + m1.getColumns());
+        System.out.println("m2 --> Rows: " + m2.getRows() + " Columns: " + m2.getColumns());
+        System.out.println("m3 --> Rows: " + m3.getRows() + " Columns: " + m3.getColumns());
+
+        //check for reference issues
+        System.out.println("m2 -->\n" + m2);
+        data2[1][1] = 101;
+        System.out.println("m2 -->\n" + m2);
+
+        //test equals
+        System.out.println("m2==null: " + m2.equals(null));             //false
+        System.out.println("m3==\"MATRIX\": " + m2.equals("MATRIX"));   //false
+        System.out.println("m2==m1: " + m2.equals(m1));                 //false
+        System.out.println("m2==m2: " + m2.equals(m2));                 //true
+        System.out.println("m2==m3: " + m2.equals(m3));                 //false
+
+        //test operations (valid)
+        System.out.println("2 * m2:\n" + m2.scale(2));
+        System.out.println("m2 + m3:\n" + m2.plus(m3));
+        System.out.println("m2 - m3:\n" + m2.minus(m3));
+	}
+
+
+    /**
+     *  Data needs to be a deep copy as not to change the original state.
+     */
+    private int[][] data;
+
+    /**
+    * Constructor for the matrix takes in a 2D array
+    *
+    * @param pData
+    */
+    public Matrix(int[][] pData) {
+
+        /** Make a deep copy of the data */
+        if(pData.length != 0) {
+            int[][] newData = new int[pData.length][pData[0].length];
+
+            for(int i = 0; i < pData.length; i++)
+                for(int j = 0; j < pData[0].length; j++)
+                    newData[i][j] = pData[i][j];
+
+            this.data = newData;
+        } else {
+            this.data = null;
+        }
+    }
+
+    /**
+    * Returns the element specified by the given location
+    *
+    * @param x : x cooridinate
+    * @param y : y cooridinate
+    * @return int : value at location
+    */
+    public int getElement(int x, int y) {
+        return data[x][y];
+    }
+
+    /**
+    * Returns the number of rows in the Matrix
+    *
+    * @return rows
+    */
+    public int getRows() {
+    	if(this.data == null)
+    		return 0;
+
+        return data.length;
+    }
+
+    /**
+    * Returns the number of rows in the Matrix
+    *
+    * @return columns
+    */
+    public int getColumns() {
+    	if(this.data == null)
+    		return 0;
+        return data[0].length;
+    }
+
+    /**
+	* Returns this matrix scaled by a factor. That is, computes sA where s is a
+	* constant and A is a matrix (this object).
+	*
+	* @param scalar : value to scale by
+	* @return A new matrix scaled by the scalar value
+	*/
+    public Matrix scale(int scalar) {
+
+    	int[][] newData = new int[this.data.length][this.data[0].length];
+
+		for (int i = 0; i < this.getRows(); ++i)
+			for(int j = 0; j < this.getColumns(); ++j)
+				newData[i][j] = this.data[i][j] * scalar;
+
+		return new Matrix(newData);
+    }
+
+    /**
+    * Adds this matrix to another matrix.
+    *
+    * @param other : Matrix to be added
+    * @return addend
+    */
+    public Matrix plus(Matrix other) throws RuntimeException {
+
+    	int[][] newData = new int[this.data.length][this.data[0].length];
+
+    	if(this.getRows() != other.getRows() || this.getColumns() != other.getColumns())
+			throw new RuntimeException("Not the same size matrix.");
+
+    	for (int i = 0; i < this.getRows(); ++i)
+			for(int j = 0; j < this.getColumns(); ++j)
+				newData[i][j] = this.data[i][j] + other.getElement(i, j);
+
+        return new Matrix(newData);
+    }
+
+    /**
+    * Subtracts this matrix from another matrix.
+    *
+    * @param other : Matrix to be subtracted
+    * @return difference
+    */
+    public Matrix minus(Matrix other) throws RuntimeException {
+
+    	int[][] newData = new int[this.data.length][this.data[0].length];
+
+    	if(this.getRows() != other.getRows() || this.getColumns() != other.getColumns())
+			throw new RuntimeException("Not the same size matrix.");
+
+    	for (int i = 0; i < this.getRows(); ++i)
+			for(int j = 0; j < this.getColumns(); ++j)
+				newData[i][j] = this.data[i][j] - other.getElement(i, j);
+
+        return new Matrix(newData);
+    }
+
+    /**
+    * Checks if the matrix passed is equal to this matrix
+    *
+	* @param other : the other matrix
+	* @return boolean
+    */
+    public boolean equals(Matrix other) {
+        return this == other;
+    }
+
+    /**
+    * Returns the Matrix as a String in the following format
+    *
+    * [ a b c ] ...
+    * [ x y z ] ...
+    * [ i j k ] ...
+    *    ...
+    *
+    * @return Matrix as String
+	* TODO: Work formatting for different digit sizes
+    */
+    public String toString() {
+        String str = "";
+
+        for(int i = 0; i < this.data.length; i++) {
+        	str += "[ ";
+            for(int j = 0; j < this.data[0].length; j++) {
+            	str += data[i][j];
+            	str += " ";
+            }
+            str += "]";
+            str += "\n";
+        }
+
+        return str;
+    }
+}

<!DOCTYPE html PUBLIC '-//W3C//DTD XHTML 1.0 Transitional//EN' 'http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd'>
<html xmlns='http://www.w3.org/1999/xhtml'>
<head>
<title>pFad - Phonifier reborn</title>
<meta http-equiv='Content-Type' content='text/html; charset=utf-8' />
</head>
<body>
<h1>Pfad - The Proxy pFad of &#169; 2024 Garber Painting. All rights reserved.</h1>


<!-- Disclaimer -->
<p>Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.</p>
<br>
<p>Alternative Proxies:</p><p><a href="http://rainy.clevelandohioweatherforecast.com/php-proxy/index.php?q=https://patch-diff.githubusercontent.com/raw/TheAlgorithms/Java/pull/66.patch" target="_blank">Alternative Proxy</a></p><p><a href="http://rainy.clevelandohioweatherforecast.com/pFad/index.php?u=https://patch-diff.githubusercontent.com/raw/TheAlgorithms/Java/pull/66.patch" target="_blank">pFad Proxy</a></p><p><a href="http://rainy.clevelandohioweatherforecast.com/pFad/v3index.php?u=https://patch-diff.githubusercontent.com/raw/TheAlgorithms/Java/pull/66.patch" target="_blank">pFad v3 Proxy</a></p><p><a href="http://rainy.clevelandohioweatherforecast.com/pFad/v4index.php?u=https://patch-diff.githubusercontent.com/raw/TheAlgorithms/Java/pull/66.patch" target="_blank">pFad v4 Proxy</a></p></body>
</html>