From 6b2b16dfe964d4d738da9f2262b3734d560933ad Mon Sep 17 00:00:00 2001
From: Touhidur Rahaman Khan <touhidurju@gmail.com>
Date: Wed, 5 Jul 2017 18:15:18 +0600
Subject: [PATCH 1/3] Add files via upload

---
 .../jugbd/marathon/day1/BiggestNumber.java    | 77 +++++++++++++++++++
 1 file changed, 77 insertions(+)
 create mode 100644 src/main/java/org/jugbd/marathon/day1/BiggestNumber.java

diff --git a/src/main/java/org/jugbd/marathon/day1/BiggestNumber.java b/src/main/java/org/jugbd/marathon/day1/BiggestNumber.java
new file mode 100644
index 0000000..1625fbe
--- /dev/null
+++ b/src/main/java/org/jugbd/marathon/day1/BiggestNumber.java
@@ -0,0 +1,77 @@
+package org.jugbd.marathon.day1;
+
+
+import java.util.Arrays;
+
+public class BiggestNumber {
+
+	
+	public static int findTheNextBiggerNumber(int num){
+		
+		int n=String.valueOf(num).length();
+		
+		int[] y=new int[n];
+		
+		int temp=num;
+		int i=0;
+		while(temp>0){
+			
+			y[i]=temp%10;
+			temp=temp/10;
+			i++;
+		}
+		
+		int[] arr=new int[n];
+		for( int m=0,k=n-1;m<n && k>=0;m++,k--){
+			
+			arr[k]=y[m];
+		}
+		
+		
+		
+		for(i=n-1;i>0;i--){
+			
+			if(arr[i]>arr[i-1]){
+				break;
+			}
+		}
+		
+		if(i==0){
+			return -1;
+		}
+		
+		int smallest1=arr[i-1];
+		int smallest2=arr[i];
+		int smlIndex=i;
+		
+		for(int j=i+1;j<n;j++){
+			if(arr[j]>smallest1 && arr[j]<smallest2){
+				smallest2=arr[j];
+				smlIndex=j;
+				
+			}
+		}
+		
+		  
+		
+		 temp=smallest1;
+		 arr[i-1]=smallest2;
+		 arr[smlIndex]=temp;
+		 
+		
+		
+		Arrays.sort(arr,i,n);
+		
+		
+		 int ans=0;
+		 for(i=0;i<n;i++){
+			 ans=ans*10+arr[i];
+		 }
+		 
+		 
+		return ans;
+	}
+	
+	
+
+}

From 3c2fcd4cb1b76187223d3c1ee122fd310b71507e Mon Sep 17 00:00:00 2001
From: Touhidur Rahaman Khan <touhidurju@gmail.com>
Date: Wed, 5 Jul 2017 22:17:31 +0600
Subject: [PATCH 2/3] Update BiggestNumber.java

---
 .../org/jugbd/marathon/day1/BiggestNumber.java   | 16 +++++-----------
 1 file changed, 5 insertions(+), 11 deletions(-)

diff --git a/src/main/java/org/jugbd/marathon/day1/BiggestNumber.java b/src/main/java/org/jugbd/marathon/day1/BiggestNumber.java
index 1625fbe..ba4e11a 100644
--- a/src/main/java/org/jugbd/marathon/day1/BiggestNumber.java
+++ b/src/main/java/org/jugbd/marathon/day1/BiggestNumber.java
@@ -1,22 +1,19 @@
 package org.jugbd.marathon.day1;
 
 
-import java.util.Arrays;
 
 public class BiggestNumber {
+	public static long findTheNextBiggerNumber(long n) {
 
-	
-	public static int findTheNextBiggerNumber(int num){
-		
-		int n=String.valueOf(num).length();
+                int n=String.valueOf(num).length();
 		
 		int[] y=new int[n];
 		
-		int temp=num;
+		long temp=num;
 		int i=0;
 		while(temp>0){
 			
-			y[i]=temp%10;
+			y[i]=(int) (temp%10);
 			temp=temp/10;
 			i++;
 		}
@@ -56,7 +53,7 @@ public static int findTheNextBiggerNumber(int num){
 		
 		 temp=smallest1;
 		 arr[i-1]=smallest2;
-		 arr[smlIndex]=temp;
+		 arr[smlIndex]=(int) temp;
 		 
 		
 		
@@ -71,7 +68,4 @@ public static int findTheNextBiggerNumber(int num){
 		 
 		return ans;
 	}
-	
-	
-
 }

From 6eded7013e0a32f0ee39b3340dc89976b2203015 Mon Sep 17 00:00:00 2001
From: Touhidur Rahaman Khan <touhidurju@gmail.com>
Date: Wed, 5 Jul 2017 22:32:14 +0600
Subject: [PATCH 3/3] Update BiggestNumber.java

---
 .../jugbd/marathon/day1/BiggestNumber.java    | 20 +++++++++----------
 1 file changed, 10 insertions(+), 10 deletions(-)

diff --git a/src/main/java/org/jugbd/marathon/day1/BiggestNumber.java b/src/main/java/org/jugbd/marathon/day1/BiggestNumber.java
index ba4e11a..2c9a15f 100644
--- a/src/main/java/org/jugbd/marathon/day1/BiggestNumber.java
+++ b/src/main/java/org/jugbd/marathon/day1/BiggestNumber.java
@@ -5,11 +5,11 @@
 public class BiggestNumber {
 	public static long findTheNextBiggerNumber(long n) {
 
-                int n=String.valueOf(num).length();
+         int length=String.valueOf(n).length();
 		
-		int[] y=new int[n];
+		int[] y=new int[length];
 		
-		long temp=num;
+		long temp=n;
 		int i=0;
 		while(temp>0){
 			
@@ -18,15 +18,15 @@ public static long findTheNextBiggerNumber(long n) {
 			i++;
 		}
 		
-		int[] arr=new int[n];
-		for( int m=0,k=n-1;m<n && k>=0;m++,k--){
+		int[] arr=new int[length];
+		for( int m=0,k=length-1;m<n && k>=0;m++,k--){
 			
 			arr[k]=y[m];
 		}
 		
 		
 		
-		for(i=n-1;i>0;i--){
+		for(i=length-1;i>0;i--){
 			
 			if(arr[i]>arr[i-1]){
 				break;
@@ -41,7 +41,7 @@ public static long findTheNextBiggerNumber(long n) {
 		int smallest2=arr[i];
 		int smlIndex=i;
 		
-		for(int j=i+1;j<n;j++){
+		for(int j=i+1;j<length;j++){
 			if(arr[j]>smallest1 && arr[j]<smallest2){
 				smallest2=arr[j];
 				smlIndex=j;
@@ -57,11 +57,11 @@ public static long findTheNextBiggerNumber(long n) {
 		 
 		
 		
-		Arrays.sort(arr,i,n);
+		Arrays.sort(arr,i,length);
 		
 		
-		 int ans=0;
-		 for(i=0;i<n;i++){
+		 long ans=0;
+		 for(i=0;i<length;i++){
 			 ans=ans*10+arr[i];
 		 }