注:此答案为网络版,非官方答案,仅供参考!
版本1:
c语言答案:
1. bestX[j] = x[i]
2. j3. x[i] = j
4. cw <= bestW
5. cp = cp - c[i][j]
java答案:
1.public State
2.tissueMachine.getHasQuarterState()
3.tissueMachine.getNoQuarterState()
4.tissueMachine.getSoldState()
5.tissueMachine.getSoldOutState()
C++答案:
1.private State
2.tissueMachine.getHasQuarter()
3.tissueMachine.getNoQuarter()
4.tissueMachine.getSold()
5.tissueMachine.getSoldOut()
版本2:
c语言答案:
1. bestX[j] = x[j]
2. j<3
3.x[i] = j
4. cw <= bestW
5. cp = cp - c[i][j]
c++答案:
1.State
2.tissueMachine.NoQuarterStateHasQuarterState()
3.tissueMachine.HasQuarterState()
4.tissueMachine.SoldState()
5.tissueMachine.SoldOutState()
版本3:
c语言答案:
1. bestX[j] = x[j]
2. j3.x[i] = j
4. cw < bestW
5. cp = cp - c[i][j]