3.5、3.6 while循环和do……while循环

- 日理万妓 2022-05-20 04:06 114阅读 0赞

![70][]![70 1][]

for：for循环重点是是达到指定次数。

while：while循环重点是满足条件即停止循环。

![70 2][]![70 3][]

#include<iostream>
    #include<cstdio>
    using namespace std;
    int main()
    {
    	int n;
    	int maxn = 0, minn = 200, sum = 0;//minn只要设置成比100大的数即可。 
    	cin >> 	n;
    	while(n)//n==0为false，停止while循环 
    	{
    		if(n > maxn) maxn = n;//更新最大值 
    		if(n < minn) minn = n;//更新最小值
    		sum += n;
    		cin >> n;
    	}
    	cout << maxn << " " << minn << " " << sum << endl;
    	return 0;
    }

![70 4][]![70 5][]![70 6][]

#include<iostream>
    #include<cstdio>
    //#define EPS 0.001
    double EPS = 0.001; 
    using namespace std;
    int main()
    {
    	double a;
    	cin >> a;
    	if(a >= 0)
    	{
    		double x1 = a/2, lastx = x1 + 1 + EPS;//lastx表示前一次的x，只要比x1大EPS即可  初始数据 
    		while ((x1 - lastx) > EPS || (lastx - x1) > EPS)//绝对值小于EPS终止循环  迭代条件 
    		{
    			lastx = x1;
    			x1 = (x1 + a/x1) / 2;
    		}
    		cout << x1 << endl;
    	}
    	else 
    		cout << "It's can't be nagitive." << endl;
    	return 0;
    }

【迭代公式写代码】

第一步： 先写初始的迭代数据；

第二步： 用while循环进行迭代。

![70 7][]

【重点】语句组至少要执行一次。

![70 8][]

#include<iostream>
    using namespace std;
    int main()
    {
    	int n = 1;
    	do
    	{
    		cout << n << " ";
    		n *= 2;
    	} while (n < 10000);
    	return 0; 
    }

#include<iostream>
    using namespace std;
    int main()
    {
    	int n = 1;
    	while (n < 10000)
    	{
    		cout << n << " ";
    		n *= 2;
    	}
    	return 0;
    }

[70]: https://img-blog.csdn.net/20180712091224570?watermark/2/text/aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3lhbnlhbndlbm1lbmc=/font/5a6L5L2T/fontsize/400/fill/I0JBQkFCMA==/dissolve/70
[70 1]: /images/20220520/100c0855bdce48cc8421cf15ed002604.png
[70 2]: https://img-blog.csdn.net/20180712091236120?watermark/2/text/aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3lhbnlhbndlbm1lbmc=/font/5a6L5L2T/fontsize/400/fill/I0JBQkFCMA==/dissolve/70
[70 3]: /images/20220520/072f7bd52ca14d1dafe88d41e1511599.png
[70 4]: https://img-blog.csdn.net/20180712091249363?watermark/2/text/aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3lhbnlhbndlbm1lbmc=/font/5a6L5L2T/fontsize/400/fill/I0JBQkFCMA==/dissolve/70
[70 5]: https://img-blog.csdn.net/20180712091255167?watermark/2/text/aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3lhbnlhbndlbm1lbmc=/font/5a6L5L2T/fontsize/400/fill/I0JBQkFCMA==/dissolve/70
[70 6]: /images/20220520/e7668492aba748db87626e4136001db8.png
[70 7]: /images/20220520/08f9d568a0a34bfab2b1ceddf5ad4248.png
[70 8]: /images/20220520/24cd16d78aa4463e895ef7f8e01eff3a.png