微软面试100题-天天做-第6题

第6题（数组）

腾讯面试题：

给你10分钟时间，根据上排给出十个数，在其下排填出对应的十个数

要求下排每个数都是先前上排那十个数在下排出现的次数。

上排的十个数如下：

【0，1，2，3，4，5，6，7，8，9】

举一个例子，

数值: 0,1,2,3,4,5,6,7,8,9

分配: 6,2,1,0,0,0,1,0,0,0

0在下排出现了6次，1在下排出现了2次，

2在下排出现了1次，3在下排出现了0次....

以此类推..

这道题真抓狂啊

package com.microsoft;

public class UpDownCount {
private Measure[][]momery;
private int[]data;
private int []solve;
public UpDownCount(int []data){
this.data=data;
this.solve=new int[data.length];
this.momery=new Measure[data.length][data.length];
for(int i=0;i<momery.length;i++){
for(int j=0;j<momery[i].length;j++){
momery[i][j]=null;
}
}
}

public void solve(){
Measure m=new Measure();
m.multipySum=data.length;
m.rowSum=data.length;
System.out.println(solve(0,data.length-1,m,0));
for(int i=0;i<solve.length;i++){
System.out.print(solve[i]+" ");
}
}
public boolean solve(int start,int end,Measure m,int lever){
if(start>end){
return false;
}
if(m.rowSum<0||m.multipySum<0){
return false;
}
if(start==end){
for(int i=data.length-1;i>=0;i--){
solve[start]=data[i];
int tmp=m.rowSum;
if(tmp*data[start]==m.multipySum&&solve[start]==m.rowSum){
//System.out.println(111);
boolean countOk=true;
for(int j=0;j<data.length;j++){
if(count(data[j])!=solve[j]){
countOk=false;
}
}
//for(int a=0;a<solve.length;a++){
//	System.out.print(solve[a]+" ");
//}
//System.out.println();
//System.out.println(countOk);
return countOk;
}
}
return false;
}else{
for(int i=data.length-1;i>=0;i--){
solve[start]=data[i];
int prefix=0;
for(int k=0;k<start;k++){
prefix+=solve[k];
}
if(prefix>data.length){
return false;
}
Measure measure=new Measure();
measure.multipySum=m.multipySum-solve[start]*data[start];
measure.rowSum=m.rowSum-solve[start];

boolean s=solve(start+1,end,measure,lever+1);
if(!s){
continue;
}
int sum=0;
int multiSum=0;
for(int j=start;j<=end;j++){
sum+=solve[j];
multiSum+=solve[j]*data[j];
}

boolean countOk=true;
if(lever==0){
if(multiSum==m.multipySum&&sum==m.rowSum){
for(int j=start;j<end;j++){
if(count(data[j])!=solve[j]){
countOk=false;
}
}
}else{
countOk=false;
}
}
if(s){
if(lever==0&&countOk){
return true;
}else if(lever==0){
continue;
}
return true;
}

}
return false;
}
}

private int count(int value){
int count=0;
for(int i=0;i<solve.length;i++){
if(solve[i]==value){
count++;
}
}
return count;
}

private class Measure{
private int rowSum;
private int multipySum;
}
public static void main(String[] args) {
int[] data=new int[]{0,1,2,3,4,5,6,7,8,9};
UpDownCount cunt=new UpDownCount(data);
cunt.solve();
}

}

效率很低，但是能解决问题

package com.microsoft;

public class UpDownCount {
private Measure[][]momery;
private int[]data;
private int []solve;
public UpDownCount(int []data){
this.data=data;
this.solve=new int[data.length];
this.momery=new Measure[data.length][data.length];
for(int i=0;i<momery.length;i++){
for(int j=0;j<momery[i].length;j++){
momery[i][j]=null;
}
}
}

public void solve(){
Measure m=new Measure();
m.multipySum=data.length;
m.rowSum=data.length;
System.out.println(solve(0,data.length-1,m,0));
for(int i=0;i<solve.length;i++){
System.out.print(solve[i]+" ");
}
}
public boolean solve(int start,int end,Measure m,int lever){
if(start>end){
return false;
}
if(m.rowSum<0||m.multipySum<0){
return false;
}
if(start==end){
for(int i=data.length-1;i>=0;i--){
solve[start]=data[i];
int tmp=m.rowSum;
if(tmp*data[start]==m.multipySum&&solve[start]==m.rowSum){
boolean countOk=true;
for(int j=0;j<data.length;j++){
if(count(data[j])!=solve[j]){
countOk=false;
}
}
return countOk;
}
}
return false;
}else{
for(int i=data.length-1;i>=0;i--){
solve[start]=data[i];
int prefix=0;
for(int k=0;k<start;k++){
prefix+=solve[k];
}
if(prefix>data.length){
return false;
}
Measure measure=new Measure();
measure.multipySum=m.multipySum-solve[start]*data[start];
measure.rowSum=m.rowSum-solve[start];

boolean s=solve(start+1,end,measure,lever+1);
if(!s){
continue;
}
return s;

}
return false;
}
}

private int count(int value){
int count=0;
for(int i=0;i<solve.length;i++){
if(solve[i]==value){
count++;
}
}
return count;
}

private class Measure{
private int rowSum;
private int multipySum;
}
public static void main(String[] args) {
int[] data=new int[]{0,1,2,3,4,5,6,7,8,9};
UpDownCount cunt=new UpDownCount(data);
cunt.solve();
}

}