Merge branch 'Development' into Development

Author: abhijay94

src/main/java/com/conversions/AnyBaseToDecimal.java

@@ -3,6 +3,7 @@
 public class AnyBaseToDecimal {
     /**
      * This method produces a decimal value of any given input number of any base
+     *
      * @param inpNum String of which we need the decimal value and base in integer format
      * @return string format of the decimal value
      */
@@ -12,28 +13,28 @@ public String convertToDecimal(String inpNum, int base) {
         int num = 0;
         int pow = 1;
 
-        for (int i=len-1; i>=0; i--) {
+        for (int i = len - 1; i >= 0; i--) {
             if (valOfChar(inpNum.charAt(i)) >= base) {
                 return "Invalid Number";
             }
-            num += valOfChar(inpNum.charAt(i))*pow;
+            num += valOfChar(inpNum.charAt(i)) * pow;
             pow *= base;
         }
         return String.valueOf(num);
     }
 
     /**
      * This method produces integer value of the input character and returns it
+     *
      * @param c Char of which we need the integer value of
      * @return integer value of input char
      */
 
     private static int valOfChar(char c) {
         if (c >= '0' && c <= '9') {
-            return (int)c - '0';
-        }
-        else {
-            return (int)c - 'A' + 10;
+            return (int) c - '0';
+        } else {
+            return (int) c - 'A' + 10;
         }
     }
 }

src/main/java/com/conversions/BinaryToGray.java

@@ -0,0 +1,26 @@
+package src.main.java.com.conversions;
+
+/**
+ * Convert the binary number into gray code
+ */
+public class BinaryToGray {
+
+    /**
+     * convert the binary number into gray code
+     *
+     * @param binaryCode binary number
+     * @return grayCode return as string
+     */
+    public String binaryToGray(String binaryCode) {
+        StringBuilder grayCode = new StringBuilder(Character.toString(binaryCode.charAt(0)));
+
+        for (int i = 0; i < binaryCode.length() - 1; i++) {
+            if (binaryCode.charAt(i) == binaryCode.charAt(i + 1))
+                grayCode.append("0");
+            else
+                grayCode.append("1");
+        }
+        return grayCode.toString();
+    }
+
+}

src/main/java/com/conversions/BinaryToHexadecimal.java

@@ -11,7 +11,7 @@ public class BinaryToHexadecimal {
      * hm to store hexadecimal codes for binary numbers
      * within the range: 0000 to 1111 i.e. for decimal numbers 0 to 15
      */
-   private static Map<Integer, String> hmHexadecimal = new HashMap<>(16);
+    private static Map<Integer, String> hmHexadecimal = new HashMap<>(16);
 
     static {
         int i;

src/main/java/com/conversions/DecimalToAnyBase.java

@@ -3,23 +3,24 @@
 import java.util.ArrayList;
 
 public class DecimalToAnyBase {
+
     /**
      * This method produces a String value of any given input decimal in any base
-     * @param inp Decimal of which we need the value in base in String format
+     *
+     * @param inp  Decimal of which we need the value in base in String format
      * @param base base in which we want the decimal value to be converted into
      * @return string format of the converted value in the given base
      */
-
     public String convertToAnyBase(int inp, int base) {
         ArrayList<Character> charArr = new ArrayList<>();
 
         while (inp > 0) {
-            charArr.add(reVal(inp%base));
+            charArr.add(reVal(inp % base));
             inp /= base;
         }
 
         StringBuilder str = new StringBuilder(charArr.size());
-        for(Character ch: charArr) {
+        for (Character ch : charArr) {
             str.append(ch);
         }
 
@@ -28,14 +29,15 @@ public String convertToAnyBase(int inp, int base) {
 
     /**
      * This method produces character value of the input integer and returns it
+     *
      * @param num integer of which we need the character value of
      * @return character value of input integer
      */
 
     private char reVal(int num) {
         if (num >= 0 && num <= 9)
-            return (char)(num + '0');
+            return (char) (num + '0');
         else
-            return (char)(num - 10 + 'A');
+            return (char) (num - 10 + 'A');
     }
 }

src/main/java/com/conversions/DecimalToHexadecimal.java

@@ -3,15 +3,16 @@
 import java.math.BigInteger;
 
 public class DecimalToHexadecimal {
-    private static final char hexChars[] = {'0','1','2','3','4','5','6','7','8','9','A','B','C','D','E','F'};
+    private static final char[] hexChars = {'0', '1', '2', '3', '4', '5', '6', '7', '8', '9', 'A', 'B', 'C', 'D', 'E', 'F'};
     private static final BigInteger valueHex = new BigInteger("16");
 
     /**
      * This method converts and decimal number to a Hexadecimal number
+     *
      * @param decimalStr
      * @return hexadecimal number
      */
-    public String decimalToHex(String decimalStr){
+    public String decimalToHex(String decimalStr) {
         BigInteger decimal = new BigInteger(decimalStr);
 
         int rem;

src/main/java/com/conversions/DecimalToOctal.java

@@ -3,20 +3,21 @@
 import java.math.BigInteger;
 
 public class DecimalToOctal {
-    private static final char octalChars[] = {'0','1','2','3','4','5','6','7'};
+    private static final char[] octalChars = {'0', '1', '2', '3', '4', '5', '6', '7'};
     private static final BigInteger valueOctal = new BigInteger("8");
 
     /**
      * This method converts and decimal number to a octal number
+     *
      * @param decimalStr
      * @return octal number
      */
-    public String decimalToOctal(String decimalStr){
+    public String decimalToOctal(String decimalStr) {
         BigInteger decimal = new BigInteger(decimalStr);
 
         int rem;
         String octal = "";
-        while(decimal.compareTo(BigInteger.ZERO) > 0) {
+        while (decimal.compareTo(BigInteger.ZERO) > 0) {
             rem = decimal.mod(valueOctal).intValueExact();
             octal = octalChars[rem] + octal;
             decimal = decimal.divide(valueOctal);

src/main/java/com/dataStructures/BinaryTree.java

@@ -2,39 +2,42 @@
 
 /**
  * Binary tree for general value type, without redundancy
- * @author RICARDO
+ *
  * @param <T> root data
  */
+
 public class BinaryTree<T extends Comparable> {
     private final T data;
-    private BinaryTree  right,  // the upper binary tree
-                        left;   // the lower binary tree
+    private BinaryTree right,  // the upper binary tree
+            left;   // the lower binary tree
 
     public BinaryTree(T data) {
         this.data = data;
     }
 
     @Override
-    public String toString(){
+    public String toString() {
         return this.data.toString();
     }
-    
+
     /**
      * inserts a new value in it's correspondant place
-     * @param newDataValue value of the new banary tree to add on this tree
+     *
+     * @param newDataValue value of the new binary tree to add on this tree
      */
-    public void insert(T newDataValue){
+    public void insert(T newDataValue) {
         this.insert(new BinaryTree(newDataValue));
     }
-    
+
     /**
      * inserts a new binary tree in it's correspondant place
-     * @param newData new value to add on this tree 
+     *
+     * @param newData new value to add on this tree
      */
-    public void insert(BinaryTree newData){
-        
+    public void insert(BinaryTree newData) {
+
         int cpr = newData.data.compareTo(this.data); //new value comparission respect to actual value
-        
+
         if (cpr < 0)
             if (this.left == null)
                 this.setLeft(newData);
@@ -51,12 +54,13 @@ else if (cpr > 0)
 
     /**
      * search and specific value on the tree
-     * @param data Searched value 
-     * @return Binary tree wich contains the value, null if it doesn't exist
+     *
+     * @param data Searched value
+     * @return Binary tree which contains the value, null if it doesn't exist
      */
-    public BinaryTree search(T data){
+    public BinaryTree search(T data) {
         int cpr = data.compareTo(this.data); //new value comparission respect to actual value
-        
+
         if (cpr < 0) {
             if (this.left == null)
                 return null;    //the value doesn't exist
@@ -65,43 +69,45 @@ public BinaryTree search(T data){
         if (cpr > 0) {
             if (this.right == null)
                 return null;    //the value doesn't exist
-            return this.right.search(data);             
+            return this.right.search(data);
         }
         return this;
     }
-    
+
     /**
      * Checks if the data value exist in the tree
+     *
      * @param data data to be searched
      * @return true if this tree contains the data value, false if not.
      */
-    public boolean contains(T data){
+    public boolean contains(T data) {
         return this.search(data) != null;
     }
-    
+
     /**
      * uses recursive black magic to print this tree in console
+     *
      * @param tabCounter prev tabs
      */
-    private void print(int tabCounter){
+    private void print(int tabCounter) {
         for (int i = 0; i < tabCounter; i++)
             System.out.print("\t");
-        
+
         System.out.println(this);
-        
+
         if (this.left != null)
             this.left.print(tabCounter + 1);  //it can't be ++ , pls don't change it
         if (this.right != null)
             this.right.print(tabCounter + 1);  //it can't be ++ , pls don't change it
     }
-    
+
     /**
      * uses black magic to print this tree in console
      */
-    public void print(){
+    public void print() {
         this.print(0);
     }
-    
+
     //getters and setters
     public T getData() {
         return data;

src/main/java/com/dataStructures/DisjointSet.java

@@ -15,7 +15,6 @@
  * <p>
  * 2. quickly query two elements whether contained in the same set, requiring about O(1) time.
  *
- * @author yangxf
  */
 public class DisjointSet<T> implements Serializable {
     private static final long serialVersionUID = 3134700471905625636L;