Dimensi TutupBotol

Monday, June 13, 2016

Check Single Swap Array in Java

Here is the code :

 public static boolean CheckSingleSwap(int[] A)
 {
  int count = 0;
  int[]B = Arrays.copyOf(A, A.length); 
  Arrays.sort(B);  
  for(int i=0; i<A.length; i++)
  {
   if(A[i] != B[i]) count++;
  }
  
  if(count > 2) return false;
  return true;
 }

Test case :

System.out.println("Test Single Swap for Array...");
 int[]A = {1,2};
     int[]B = {1,3,6,3,5,5,3,7,7};
     int[]C = {1, 4, 5, 6, 7, 2}; 
     int[]D = {1,2,3,4,5,6,7,8,9,10,11,2,45,56,67,78,89,90,123,124,1245566778};
     int[]D1 = {1,2,3,4,5,6,7,8,9,10,11,2,45,56,67,78,89,90,2,123,124,1245566778};
     int[]E = {1, 5, 3, 3, 7} ;
     int[]F= {1, 3, 5};
     int[]G = {1,5,3};
     int[]H = {1, 2, 6, 3, 4, 5};

     System.out.println("A : "+CheckSingleSwap(A));
     System.out.println("B : "+CheckSingleSwap(B));
     System.out.println("C : "+CheckSingleSwap(C));
     System.out.println("D : "+CheckSingleSwap(D));
     System.out.println("D1 : "+CheckSingleSwap(D1));
     System.out.println("E : "+CheckSingleSwap(E));
     System.out.println("F : "+CheckSingleSwap(F));
     System.out.println("H : "+CheckSingleSwap(H));

Output :

A : true
B : true
C : false
D : false
D1 : false
E : true
F : true
H : false

Thursday, June 9, 2016

ArrayInversionCount Codility - Road to 100% - Java

Task Link : https://codility.com/programmers/task/array_inversion_count/

First solution (72%):

class Solution {
    public int solution(int[] A) {
        // write your code in Java SE 8
        int count = 0;
  for(int p=0; p<A.length; p++)
  {
   for(int q=p+1; q<A.length; q++)
   {
    if(A[p]>A[q]) count++;
   }
  }
  if(count > 1000000000) return -1;
  return count;
    }
}

Result : https://codility.com/demo/results/trainingXBUESU-MQG/

Second Solution (100%) :

// you can also use imports, for example:
 import java.util.*;

// you can write to stdout for debugging purposes, e.g.
// System.out.println("this is a debug message");

class Solution {
    public int solution(int[] arr) {
        // write your code in Java SE 8
        if (arr.length < 2)
         return 0;

     int m = (arr.length + 1) / 2;
     int left[] = Arrays.copyOfRange(arr, 0, m);
     int right[] = Arrays.copyOfRange(arr, m, arr.length);

        int result = solution(left) + solution(right) + merge(arr, left, right);
        if(result > 1000000000) return -1;
     return result;
    }
    
    
    
    int merge(int[] arr, int[] left, int[] right) {
     int i = 0, j = 0, count = 0;
     while (i < left.length || j < right.length) {
         if (i == left.length) {
             arr[i+j] = right[j];
             j++;
         } else if (j == right.length) {
             arr[i+j] = left[i];
             i++;
         } else if (left[i] <= right[j]) {
             arr[i+j] = left[i];
             i++;                
         } else {
             arr[i+j] = right[j];
             count += left.length-i;
             j++;
         }
     }
     return count;
 }
}

Result : https://codility.com/demo/results/training57Y8R2-QK9/