CareerCup

package Questions;

public class MaxOneDiff {

	public static void main(String[] args) {
		int k = 4;
		getList(k);
	}

	public static void getList(int k) {

		int arr[] = new int[k];
		int index = 0;
		printRecList(k, arr, index, k);

	}

	public static void printRecList(int k, int arr[], int index, int range) {

		if (k == 0) {
			for (int i = 0; i < arr.length; i++) {
				System.out.print(arr[i]);

			}
			System.out.println();
		} else {

			for (int i = 1; i <= range; i++) {
				if (index == 0) {
					arr[index] = i;
					printRecList(k - 1, arr, index + 1, range);

				}
				else{
					int t=arr[index-1]-i;
					t=t>0?t:-t;
					if(t<2){
						arr[index] = i;
						printRecList(k - 1, arr, index + 1, range);

						
					}
					
					
				}
			}

		}

	}

}

1232 ? Is it wrong?

Assuming n is the length of the input sequence :-
Assuming p1.....pn be the numbers of length n, and p1 to pn = 1.
for (i=1 to n-1) {
T(n)
}

T(k) {
if ( p(k) == p(k-1) {
p(k) = p(k) + 1;
}
print (p);
T(k-1)
}

Here print p will print the the updated p values.

why have you missed 0? If 121 is a valid solution (for the case of k=3), why shouldn't we have 110?

void dfs(int pos,int now,int mn,int k)
{
if(pos==k) printf("%d\n",now);
else
{
for(int i=1;i<=mn+1&&i<10;i++)
{
dfs(pos+1,now*10+i,max(mn,i),k);
}
}
}

dfs(0,0,0,k);

void PrintAllArangments(int Num,int *Out,int Pos,int Size)
{
if(Pos == Size)
{
for(int i = 0; i < Size; ++i)
{
cout << Out[i] << ",";
}

cout << endl;
}
else
{
for(int i = 1; i <= Num; ++i)
{
if(i <= Pos + 1)
{
Out[Pos] = i;
PrintAllArangments(Num,Out,Pos + 1,Size);
}
}
}
}

Please help me in understanding this question with some more examples.

#include<stdio.h>
int n;
void fun(int *a,int j)
{
int k,i;
if(j==n)
{
for(i=0;i<n;i++)
printf("%d",a[i]);
printf("\n");
return;
}
for(j,k=0;k<=j;k++)
{
a[j]=k+1;
fun(a,j+1);
}
}
int main()
{
scanf("%d",&n);
int a[n],i;
fun(a,0);
return 0;
}