I encountered a code as follows
if(n>win) {
p=-win;
}
else if(n<0){
p=0;
}
else {
p=n;
}
There are quite a lot of similar codes, and it continues to be simplified. It is actually very simple, and it becomes like this
p=((n>win)&&(-win))||((n<0)&&0)||n
In summary: && get the last value, || get the first satisfying value, which is efficient, but please use it flexibly
if(n>win) {
p=-win;
}
else if(n<0){
p=0;
}
else {
p=n;
}
There are quite a lot of similar codes, and it continues to be simplified. It is actually very simple, and it becomes like this
p=((n>win)&&(-win))||((n<0)&&0)||n
In summary: && get the last value, || get the first satisfying value, which is efficient, but please use it flexibly