Misc Concepts Update

Misc Concepts Update

Author: careermonk

bin/chapter21miscconcepts/AddOneToNumber.class

@@ -0,0 +1,35 @@
+/*Copyright (c) Dec 22, 2014 CareerMonk Publications and others.
+ * E-Mail           	: info@careermonk.com 
+ * Creation Date    	: 2015-01-10 06:15:46 
+ * Last modification	: 2006-05-31 
+               by		: Narasimha Karumanchi 
+ * File Name			: AddOneToNumber.java
+ * Book Title			: Data Structures And Algorithms Made In Java
+ * Warranty         	: This software is provided "as is" without any 
+ * 							warranty; without even the implied warranty of 
+ * 							merchantability or fitness for a particular purpose. 
+ * 
+ */
+
+
+package chapter21miscconcepts;
+
+public class AddOneToNumber {
+	public int[] addOneToNumber(int[] digits) {
+		int[] result = new int[digits.length];
+		int one = 1;
+		
+		for(int i = digits.length-1;i>=0;i--){
+			result[i] = (digits[i]+one) % 10;
+			one = (digits[i]+one) / 10;
+		}
+		
+		if(one!=0){
+			int[] more = new int[digits.length+1];
+			more[0] = one;
+			System.arraycopy(result, 0, more, 1, result.length);
+			result = more;
+		}
+		return result;		
+	}
+}

bin/chapter21miscconcepts/CheckEndian.class

@@ -0,0 +1,29 @@
+/*Copyright (c) Dec 22, 2014 CareerMonk Publications and others.
+ * E-Mail           	: info@careermonk.com 
+ * Creation Date    	: 2015-01-10 06:15:46 
+ * Last modification	: 2006-05-31 
+               by		: Narasimha Karumanchi 
+ * File Name			: CheckEndian.java
+ * Book Title			: Data Structures And Algorithms Made In Java
+ * Warranty         	: This software is provided "as is" without any 
+ * 							warranty; without even the implied warranty of 
+ * 							merchantability or fitness for a particular purpose. 
+ * 
+ */
+
+
+package chapter21miscconcepts;
+
+import java.nio.ByteOrder;
+public class CheckEndian {
+	public static boolean isBigEndian() {
+	   if(ByteOrder.nativeOrder().equals(ByteOrder.BIG_ENDIAN))
+	      return true;
+	   return false;
+	}
+	public static boolean isLittleEndian() {
+	   if(ByteOrder.nativeOrder().equals(ByteOrder.LITTLE_ENDIAN))
+	      return true;
+	   return false;
+	}
+}

bin/chapter21miscconcepts/Equilibrium.class

@@ -0,0 +1,38 @@
+package chapter21miscconcepts;
+/*Copyright (c) Dec 22, 2014 CareerMonk Publications and others.
+ * E-Mail           	: info@careermonk.com 
+ * Creation Date    	: 2015-01-10 06:15:46 
+ * Last modification	: 2006-05-31 
+               by		: Narasimha Karumanchi 
+ * File Name			: Equilibrium.java
+ * Book Title			: Data Structures And Algorithms Made In Java
+ * Warranty         	: This software is provided "as is" without any 
+ * 							warranty; without even the implied warranty of 
+ * 							merchantability or fitness for a particular purpose. 
+ * 
+ */
+
+public class Equilibrium {	
+	public static int equilibrium(int[] A){
+		int sum = 0;
+		int leftsum = 0;
+		int i;
+		
+		for(i = 0;i<A.length;i++){
+			sum += A[i];
+		}
+		
+		for(i = 0; i<A.length;i++){
+			sum -= A[i];
+			if(leftsum == sum){
+				return i;
+			}
+			leftsum += A[i];
+		}
+		return -1;
+	}
+	public static void main(String[] args) {
+		int[] A = {-7,1,5,2,-4,3,0};
+		System.out.print(equilibrium(A));	// Would Print 3
+	}
+}