// SPDX-License-Identifier: GPL-3.0
pragma solidity >=0.7.0 <0.9.0;
/*
控制结构
if else
for
while
do whlie
*/
contract ifelse {
//hanshu
function test1(uint x) public pure returns (uint){
if(x<10){
return 0;
}else if (x<20){
return 1;
}else {
return 3;
}
}
function test2(uint x) public pure returns(uint){
return (x<10)?1:2;
}
}
// SPDX-License-Identifier: GPL-3.0
pragma solidity >=0.7.0 <0.9.0;
/*
控制结构
if else
for
while
do whlie
*/
contract ifelse {
//hanshu
function test1(uint x) public pure returns (uint){
if(x<10){
return 0;
}else if (x<20){
return 1;
}else {
return 3;
}
}
function test2(uint x) public pure returns(uint){
return (x<10)?1:2;
}
}
// SPDX-License-Identifier: GPL-3.0
pragma solidity >=0.7.0 <0.9.0;
/*
控制结构
if else
for
while
do whlie
*/
contract Loop {
//hanshu
function test1() public pure returns (uint){
//计算1-10所有奇数的和(遇到6中断)
uint sum =0;
for(uint i=1;i<=10;i++){
if(i6)
break;
if(i%20)
continue;
sum+=i;
}
return sum;
}
//while
function test2() public pure returns(uint){
uint sum = 0;
uint i=1;
while(i<=10){
sum+=i;
i++;
}
return sum;
}
//do while
function test3() public pure returns(uint){
uint sum = 0;
uint i=1;
do{
sum+=i;
i++;
}while(i<=10);
return sum;
}
}
// SPDX-License-Identifier: GPL-3.0
pragma solidity >=0.7.0 <0.9.0;
/*
控制结构
if else
for
while
do whlie
*/
contract Loop {
//hanshu
function test1() public pure returns (uint){
//计算1-10所有奇数的和(遇到6中断)
uint sum =0;
for(uint i=1;i<=10;i++){
if(i==6)
break;
if(i%2==0)
continue;
sum+=i;
}
return sum;
}
//while
function test2() public pure returns(uint){
uint sum = 0;
uint i=1;
while(i<=10){
sum+=i;
i++;
}
return sum;
}
//do while
function test3() public pure returns(uint){
uint sum = 0;
uint i=1;
do{
sum+=i;
i++;
}while(i<=10);
return sum;
}
}