liyinuojunjie
BAN USERpublic class Permutation {
public static void main(String[] args){
int a[]={1,2,3,4};
permute(a,0);
}
public static void permute(int[] a, int k){
if(k == a.length){
for(int i = 0; i < a.length; i++){
System.out.print(a[i]);
}
System.out.print("\n");
return;
}
else{
for(int i = k; i < a.length; i++){
int temp = a[k];
a[k] = a[i];
a[i] = temp;
permute(a,k+1);
temp = a[k];
a[k] = a[i];
a[i] = temp;
}
}
}
}
public class Spiral {
public static void main(String[] args) {
// TODO Auto-generated method stub
char[][] c = {{'c','i','p','e'},{'r','n','k','u'},{'u','o','w','o'},{'l','e','s','y'}};
printTopLeft(c,0,c.length-1,1,c.length-1);
}
public static void printTopLeft(char a[][], int cleft, int cright, int rup, int rdown){
for(int j = cright; j >= cleft; j--){
System.out.print(a[rup-1][j]);
}
for(int i = rup; i <= rdown ; i++){
System.out.print(a[i][cleft]);
}
if(cright > cleft){
printBottemRight(a, cleft+1, cright, rup, rdown-1);
}
}
public static void printBottemRight(char a[][], int cleft, int cright, int rup, int rdown){
for(int j = cleft; j <= cright; j++){
System.out.print(a[rdown+1][j]);
}
for(int i = rdown; i >= rup ; i--){
System.out.print(a[i][cright]);
}
if(cright > cleft){
printTopLeft(a, cleft, cright-1, rup+1, rdown);
}
}
}
public class Test {
public static void main(String[] args) {
// TODO Auto-generated method stub
int[] input = new int[] {4,7,3,6,7};
compute(input);
for(int i = 0; i < input.length; i++){
System.out.print(input[i] + " ");
}
}
public static void compute(int[] input){
if(input.length == 0)
return;
int newlength = input.length;
int newinput[] = new int[newlength - 1];
//if(input.length > 0){
for(int i = 0; i < input.length-1; i++){
//System.out.print(input[i]);
newinput[i] = input[i] + input[i+1];
}
//}
compute(newinput);
for(int i = 0; i < newinput.length; i++){
System.out.print(newinput[i] + " ");
}
System.out.print( "\n");
}
}
for(i = s; i < e; i++ )
{
int copy = i;
do{
a = copy %10;
copy = copy / 10;
b = copy%10;
}while((a==b-1||a-1==b)&& copy > 10);
if(copy < 10)
{
if(a==b-1 || a-1 == b)
{
printf("%d",i);
}
}
}
- liyinuojunjie October 19, 2014