zoukankan      html  css  js  c++  java
  • C# yield return; yield break;

    using System;
    using System.Collections;
     
    namespace YieldDemo
    {
         
        class Program
        {
            public static IEnumerable Power(int num, int exponent)
            {
                int counter = 0;
                int result = 1;
                while (counter++ < exponent)
                {
                    //if (counter == 4) yield break;
                    if (counter == 4) yield return null;
                    result = result * num;
                    yield return result;
                }
            }
            public static IEnumerator Power2(int num, int exponent)
            {
                int counter = 0;
                int result = 1;
                while (counter++ < exponent)
                {
                    //if (counter == 4) yield break;
                    if (counter == 4) yield return null;
                    result = result * num;
                    yield return result;
                }
            }
            static void Main(string[] args)
            {
                foreach (var item in Power(2,8))
                {
                    Console.WriteLine(item);
                }
     
                Console.WriteLine("---");
                var e = Power2(2, 8);
                while (e.MoveNext())
                {
                    var i = e.Current;
                    Console.WriteLine(i);
                }
     
                Console.WriteLine("main done");
                Console.ReadKey();
            }
        }
    }
  • 相关阅读:
    BZOJ 3626: [LNOI2014]LCA(树链剖分+离线处理)
    python备用
    STL的使用。。备忘
    DP专题
    任务
    hdu 网络流题集
    hdu KM匹配题集
    hdu 差分约束题集
    hdu 2sat题集
    Codeforces Round #261 (Div. 2)
  • 原文地址:https://www.cnblogs.com/Cein/p/9725109.html
Copyright © 2011-2022 走看看