C#练习题答案: Vasya和图书【难度:1级】--景越C#经典编程题库,1000道C#基础练习题等你来挑战

Vasya和图书【难度:1级】:

答案1:

using System;
 
public class Book
    {
        public static int DayIs(int pages, int [] days)
        {
            var currentDay = 0;
            
            while(pages > 0) {
              pages -= days[currentDay % days.Length];
              currentDay++;
            }
            
            return currentDay % days.Length == 0 ? 7 : currentDay % days.Length;
        }
    }

答案2:

using System;
using System.Collections.Generic;
using System.Linq;
 
public class Book
    {
        public static int DayIs(int pages, int [] days)
        {
            int NumberOfPagesRead = 0;
            int count = 0;

            while(NumberOfPagesRead < pages)
            {
             if(count > days.Count() - 1)
             {
              count = 0;  
             }
             NumberOfPagesRead += days[count];
             count++; 
            }

            return days.Count() > 7 ? days.Count() - count : count;

        }
    }

答案3:

using System;
 
public class Book
    {
        public static int DayIs(int pages, int [] days)
        {
            int currentDay = 0;
            while(pages>0){
              currentDay= currentDay>6 ? 0 : currentDay;
              pages -= days[currentDay];
              currentDay++;
            }
            return currentDay;
        }
    }

答案4:

using System;
using System.Linq;
 
public class Book
    {
        public static int DayIs(int pages, int [] days)
        {
            return days
              .Select((x,i)=>new {Day=x, Index = i, Already = days.Where((y,j)=>j<=i).Sum()})
              .Single(x=> pages>x.Already - x.Day &amp;&amp; pages <= x.Already)
              .Index + 1;
            
        }
    }

答案5:

public class Book
{
  public static int DayIs(int pages, int [] days)
  {
    for(int i = -1;;)
    {
      pages -= days[++i % days.Length];
      if(pages <= 0) return i % days.Length + 1;
    }
  }
}

答案6:

using System;
using System.Linq;
 
public class Book
    {
        public static int DayIs(int pages, int [] days)
        {
            int i = 0;
            int tempDay = 0;
            int tempBook = pages;
            
           
           while(tempBook > days.Sum())
            {
             tempBook -= days.Sum();
            }
            
            while(tempBook > 0)
            {
              tempBook -=days[i];
              i++;
              tempDay = i;
            }
            return tempDay;
        }
    }

答案7:

using System;
using System.Linq;

public class Book
    {
        public static int DayIs(int pages, int [] days)
        {
            var _days = days.Select((x,i)=> new{day=i+1, pages=x});
            int day=0;
            while(pages>0){
              day = _days.FirstOrDefault(x=>(pages-=x.pages) <= 0)?.day ?? 0;
            }
            return day;
        }
    }

答案8:

using System;
 
public class Book
    {
        public static int DayIs(int pages, int [] days)
        {
            // Your code is here...
            int left = pages;
            int day=0;
            while(left >0)
            {
            for(int i=0; i< days.Length; i++)
            {
              left -=days[i];
              
              if(left <=0)
              {
              day=i;
              break;
              }
            }
            }
            
            return day+1;
        }
    }

答案9:

using System;
 
public class Book
    {
        public static int DayIs(int pages, int [] days)
        {
            // Your code is here...
            
            int day=0;
            while(pages>0)
            {
                day++;
                if(day>days.Length)
                    day=1;
                pages-=days[day-1];
                
            }
            
            return day;
        }
    }

答案10:

using System;
 
public class Book
    {
        public static int DayIs(int pages, int[] days)
        {
            int i = 0;
            while (true)
            {
                if (pages <= 0)
                { 
                    int day = i % 7;
                    return (day == 0) ? 7 : day;
                }

                pages -= days[i % 7];
                i++;
            }
        }
    }



  • 0
    点赞
  • 1
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值