mirror of
https://github.com/discourse/discourse.git
synced 2025-03-03 00:59:38 +08:00
4ce99c998b
My first JavaScript! I have little experience with C++ and even less with Java, but that was enough to figure out a way to solve the task. The solution is rather good, but there may be better ways. I'm going to start a pull request. Even if it gets rejected, an expert can use the idea. NOTE: The code needs some serious testing before potential merging. I did some testing and it worked, but don't trust in my skills.
30 lines
1004 B
JavaScript
30 lines
1004 B
JavaScript
// works as described on http://stackoverflow.com/a/13483710
|
|
function sumsUpTo100(percentages) {
|
|
return percentages.map(p => Math.floor(p)).reduce((a, b) => a + b) === 100;
|
|
}
|
|
|
|
export default (percentages) => {
|
|
var decimals = percentages.map(a => a % 1);
|
|
const sumOfDecimals = Math.ceil(decimals.reduce((a, b) => a + b));
|
|
// compensate error by adding 1 to n items with the greatest decimal part
|
|
for (let i = 0, max = decimals.length; i < sumOfDecimals && i < max; i++) {
|
|
// find the greatest item in the decimals array, set it to 0,
|
|
// and increase the corresponding item in the percentages array by 1
|
|
let greatest = 0;
|
|
let index = 0;
|
|
for (let j=0; j < decimals.length; j++) {
|
|
if (decimals[j] > greatest) {
|
|
index = j;
|
|
greatest = decimals[j];
|
|
}
|
|
}
|
|
++percentages[index];
|
|
decimals[index] = 0;
|
|
// quit early when there is a rounding issue
|
|
if (sumsUpTo100(percentages)) break;
|
|
}
|
|
|
|
return percentages.map(p => Math.floor(p));
|
|
};
|
|
|