标题:判断一组不等式是否满足约束并输出最大差
给定一组不等式,判断是否成立并输出不等式的最大差(输出浮点数的整数部分),要求:
1)不等式系数为double类型,是一个二维数组;
2)不等式的变量为int类型,是一维数组;
3)不等式的目标值为double类型,是一维数组;
4)不等式约束为字符串数组,只能是:">",">=","<","<=","=",例如,不等式组:
a11x1+a12x2+a13x3+a14x4+a15*x5<=b1;
a21x1+a22x2+a23x3+a24x4+a25*x5<=b2;
a31x1+a32x2+a33x3+a34x4+a35*x5<=b3;
最大差=max{ (a11x1+a12x2+a13x3+a14x4+a15x5-b1), (a21x1+a22x2+a23x3+a24x4+a25x5-b2),
(a31x1+a32x2+a33x3+a34x4+a35*x5-b3) },类型为整数(输出浮点数的整数部分)
输入描述:
1)不等式组系数(double类型):
a11,a12,a13,a14,a15
a21,a22,a23,a24,a25
a31,a32,a33,a34,a35
2)不等式变量(int类型):
x1,x2,x3,x4,x5
3)不等式目标值(double类型):b1,b2,b3
4)不等式约束(字符串类型):<=,<=,<=
输入:a11,a12,a13,a14,a15;a21,a22,a23,a24,a25;a31,a32,a33,a34,a35;x1,x2,x3,x4,x5;b1,b2,b3;<=,<=,<=
输出描述:
true 或者 false, 最大差
示例1
输入
2.3,3,5.6,7,6;11,3,8.6,25,1;0.3,9,5.3,66,7.8;1,3,2,7,5;340,670,80.6;<=,<=,<=
输出
false 458
示例2
输入
2.36,3,6,7.1,6;1,30,8.6,2.5,21;0.3,69,5.3,6.6,7.8;1,13,2,17,5;340,67,300.6;<=,>=,<=
输出
false 758
function test(){
let str = '2.3,3,5.6,7,6;11,3,8.6,25,1;0.3,9,5.3,66,7.8;1,3,2,7,5;340,670,80.6;<=,<=,<='
let arr = str.split(';')
let budengshiArr = arr[arr.length - 1].split(',')
let mubiaoArr = arr[arr.length - 2].split(',').map(e=>Number(e))
let bianliangArr = arr[arr.length - 3].split(',').map(e=>Number(e))
let xishuArr = JSON.parse(JSON.stringify(arr)).splice(0,arr.length-3)
let resultBoolean = []
let result = []
for(let [idx,i] of xishuArr.entries()){
let itemArr = i.split(',').map(e=>Number(e))
let sum = 0
for(let [jdx,j] of itemArr.entries()){
sum+=j*bianliangArr[jdx]
}
let fn = new Function (`return ${sum}${budengshiArr[idx]}${mubiaoArr[idx]}`)
resultBoolean.push(fn())
result.push(Math.abs(sum-mubiaoArr[idx]))
}
let flag = ''
for(let i of resultBoolean){
if(flag===''){
flag = i
}else {
flag = i&&flag
}
}
console.log(flag + ' ' + parseInt(Math.max(...result)))
}
test()