Where is Vasya?

寻找Vasya的位置

最新推荐文章于 2020-07-31 20:21:38 发布

转载最新推荐文章于 2020-07-31 20:21:38 发布 · 121 阅读

本文介绍了一个算法问题，即在已知队伍总人数及Vasya前方和后方人数限制的情况下，找出Vasya可能站的位置数量。文章提供了两种解决方案，并使用了C#语言进行实现。

Where is Vasya?

Vasya stands in line with number of people p (including Vasya), but he doesn't know exactly which position he occupies. He can say that there are no less than b people standing in front of him and no more than apeople standing behind him. Find the number of different positions Vasya can occupy.

Input

As an input you have 3 numbers:

1. Total amount of people in the line;

2. Number of people standing in front of him

3. Number of people standing behind him

Examples

Line.WhereIsHe(3, 1, 1) // => 2 The possible positions are: 2 and 3
Line.WhereIsHe(5, 2, 3) // => 3 The possible positions are: 3, 4 and 5

The third parameter is not irrelavant and is the reason why (9,4,3) is 4 not 5
you have to satisfy both conditions
no less than bef people in front of him
and
no more than aft people behind him

as far as i can tell all the test cases are correct

9个人，前面的人不少于4个，后面的人不多于3个的话，可以占据6，7，8，9 是个位置

第五个位置，虽然前面是4个人，但是后面也是4个人。后面的人数超过3了，就不符合。

using System;

public class Line
    {
        public static int WhereIsHe(int p, int bef ,int aft)
        { 
           // Your code is here...
           int count=0;
           int a=0;//people infront of him
           int b=0;//people behind him
          for(int i=1;i<=p;i++)
          {
           a=i-1;
           b=p-i;
           if(a>=bef&&b<=aft)
           {
           count++;
           }
          }
          return count;
        }
    }

使用Linq进行简化后：

using System;
using System.Linq;
public static int WhereIsHe(int p, int bef, int aft)
{
    return Enumerable.Range(1, p).Where(x => x - 1 >= bef && p - x <= aft).Count();
}

其他人的解法

using System;

public class Line
    {
        public static int WhereIsHe(int p, int bef ,int aft)
        { 
           return Math.Min(p-bef,aft+1);
        }
    }