selva.vedamanickam
BAN USERpublic class SpecialProp {
public static void main(String[] args) {
int[] input = {3,2,5,4,1};
findProfit(input);
}
private static void findProfit(int[] input) {
int min=input[0];
int max=input[0];
int minPos=0;
int maxPos=0;
for(int i=0; i<input.length; i++){
if(input[i]>max){
max=input[i];
maxPos=i;
}
}
for(int i=0; i<maxPos; i++){
if(input[i]<min){
min=input[i];
minPos=i;
}
}
System.out.println("Mininum : " +min);
System.out.println("Maximum : " +max);
}
}
- selva.vedamanickam April 11, 2013This works for the 6 5's
public class Denominations {
public static void main(String[] args){
int[] d = {1,5,10,25};
int[] maxdCount = new int[d.length];
int sum = 30;
int n = 6;
populateMaxdCount(d,maxdCount,sum,n);
printCombinations(sum,n,d,maxdCount,d.length-1, new ArrayList<String>());
//for(int i:maxdCount)System.out.println(i);
}
private static void printCombinations(int sum, int n, int[] d, int[] maxdCount, int curr, List<String> combinations) {
if(sum==0 && n==0){
System.out.println(combinations);
return;
}else if(sum<0 || n<0 || curr<0){
return;
}
for(int i=maxdCount[curr];i>=0;i--){
combinations.add(i +" "+ d[curr]);
printCombinations(sum-(i*d[curr]), n-i, d, maxdCount, curr-1, combinations);
combinations.remove(i +" "+ d[curr]);
}
}
private static void populateMaxdCount(int[] d, int[] maxdCount, int sum, int n) {
for(int i=0;i<d.length; i++){
int count=sum/d[i];
maxdCount[i]=(count>n?n:count);
}
}
}
- selva.vedamanickam April 06, 2013
Can you please explain the set_hash function... I am java skilled and have no idea about bit manipulation...
- selva.vedamanickam April 14, 2013