CodeFights: areSimilar

areSimilar.java

boolean areSimilar(int[] A, int[] B) {
    
    ArrayList<Position> mismatchedPosition = new ArrayList<>();
    
    for(int i = 0; i < A.length; i++){
        
        int a = A[i];
        int b = B[i];
        
        if(a != b){
            Position p = new Position(i, a, b);
            mismatchedPosition.add(p);
        }
    }
    
    if(mismatchedPosition.size() == 0)
        return true;
    else if(mismatchedPosition.size() == 2){
        Position pos1 = mismatchedPosition.get(0);
        Position pos2 = mismatchedPosition.get(1);
        
        int aPos1 = pos1.aElement;
        int bPos1 = pos1.bElement;
        
        int aPos2 = pos2.aElement;
        int bPos2 = pos2.bElement;
        
        if(aPos1 == bPos2 && bPos1 == aPos2)
            return true;
        else
            return false;
    }
    else
        return false;
    
}

class Position{
    int position;
    int aElement;
    int bElement;
    
    Position(int pos, int a, int b) {
        position = pos;
        aElement = a;
        bElement = b;
    }
}