CareerCup

import java.util.*;

public class AdjacentNumbers {
	public static void bfs(int m, int n, int num) {
		Queue<Integer> q = new LinkedList<Integer>();
		q.add(num);
		while (!q.isEmpty()) {
			int stepNum = q.poll();
			if (stepNum <= n && stepNum >= m) {
				System.out.print(stepNum + " ");
			}
			if (stepNum == 0 || stepNum > n)
				continue;
			int lastDigit = stepNum % 10;
			int stepNumA = stepNum * 10 + (lastDigit - 1);
			int stepNumB = stepNum * 10 + (lastDigit + 1);
			if (lastDigit == 0)
				q.add(stepNumB);
			else if (lastDigit == 9)
				q.add(stepNumA);
			else {
				q.add(stepNumA);
				q.add(stepNumB);
			}
		}
	}

	public static void main(String args[]) {
		int n = 0, m = 21;
		for (int i = 0; i <= 9; i++)
			bfs(n, m, i);
	}
}

void DifferenceBetweenAdjacentDigits(int m, int n)
{
for (int i = m; i <= n; i++)
{
if (i <= 9)
{
Console.WriteLine(i);
}
else
{
int unitsDigit = i % 10;
int tensDigit = i / 10;
int difference = Math.Abs(unitsDigit - tensDigit);
if (difference == 1)
{
Console.WriteLine(i);
}
}
}
}

void DifferenceBetweenAdjacentDigits(int m, int n)
        {
            for (int i = m; i <= n; i++)
            {
                if (i <= 9)
                {
                    Console.WriteLine(i);
                }
                else
                {
                    int unitsDigit = i % 10;
                    int tensDigit = i / 10;
                    int difference = Math.Abs(unitsDigit - tensDigit);
                    if (difference == 1)
                    {
                        Console.WriteLine(i);
                    }
                }
            }
        }

void DifferenceBetweenAdjacentDigits(int m, int n)
        {
            for (int i = m; i <= n; i++)
            {
                if (i <= 9)
                {
                    Console.WriteLine(i);
                }
                else
                {
                    int unitsDigit = i % 10;
                    int tensDigit = i / 10;
                    int difference = Math.Abs(unitsDigit - tensDigit);
                    if (difference == 1)
                    {
                        Console.WriteLine(i);
                    }
                }
            }
        }

public ArrayList<Integer> adjacents (int n, int m){
    	ArrayList<Integer> results = new ArrayList<>();
    	for(int i = 0; i<m; i++){
    		if(i<=9){
    			results.add(i);
    		} else {
    			int firstDigit = i / 10;
    			results.add(i+(firstDigit-1));
    			results.add(i+firstDigit+1);
    			i+=9;
    		}
    	}
    	return results;
    }

public ArrayList<Integer> adjacents (int n, int m){
    	ArrayList<Integer> results = new ArrayList<>();
    	for(int i = 0; i<m; i++){
    		if(i<=9){
    			results.add(i);
    		} else {
    			int firstDigit = i / 10;
    			results.add(i+(firstDigit-1));
    			results.add(i+firstDigit+1);
    			i+=9;
    		}
    	}
    	return results;

}