给定一组数据,每个数据都有一定权重,请写算法计算中位数。用java实现
数值[0.5,1.24,18,1.4,2.1,3.2,2.5,13,2.6,18,2.55,1.2,1.83,1.3,2.1]
权重[0.8,0.2,1.98,1.4,2.1,3.8,2.1,2.12,0.5,5.6,1.1,1.2,3.5,1.2,1.5]
最好有代码,谢谢了

<求教>java算法带权数据求中位数的问题
- 写回答
- 好问题 0 提建议
- 关注问题
- 邀请回答
-
6条回答 默认 最新
- Howden081219 2018-01-07 05:33关注
public class FindMdlInArray {
public static void main(String args[]) { double []num = {0.5,1.24,18,1.4,2.1,3.2,2.5,13,2.6,18,2.55,1.2,1.83,1.3,2.1}; double []weight = {0.8,0.2,1.98,1.4,2.1,3.8,2.1,2.12,0.5,5.6,1.1,1.2,3.5,1.2,1.5}; double tmp[] = new double[num.length]; for (int i = 0; i < num.length; i++) tmp[i] = num[i] * weight[i];
//
// for (int k = 0; k < num.length; k++)
// System.out.print(tmp[k] + " ");
// System.out.println();double mld = getMdlInArray(tmp, num); System.out.println("位数 = " + mld); } public static double getMdlInArray(double array[], double num[]) { double k; // 对array, num数组排序 for (int i = 0; i < array.length; i++) { for (int j = 1; j < array.length - i; j++) if (array[j - 1] > array[j]) { k = array[j - 1]; array[j - 1] = array[j]; array[j] = k; k = num[j - 1]; num[j - 1] = num[j]; num[j] = k; } }
// for (int t = 0; t < num.length; t++)
// System.out.print(array[t] + " ");
// System.out.println();
return num[(num.length-1)/2];
}
}本回答被题主选为最佳回答 , 对您是否有帮助呢?解决 无用评论 打赏 举报