leetcode849

public class Solution
    {
        public int MaxDistToClosest(int[] seats)
        {

            int lastST = seats.Length - ;
            var len = seats.Length;

            if (len < )
            {
                return len - ;
            }
            var list = new List<int>();
            for (int i = ; i < len; i++)
            {
                if (seats[i] == )
                {
                    list.Add(i);
                }
            }

            var begin = ;
            var end = ;
            var maxlen = ;
            var position = -;
            for (int i = ; i < list.Count; i++)
            {
                var dis = list[i] - list[i - ];
                if (maxlen *  < dis)
                {
                    maxlen = dis / ;
                    begin = list[i - ];
                    end = list[i];
                }
            }
            position = (end - begin) / ;

            if (list[] != )//第一个有人的位置不是最左边
            {
                if (maxlen < list[])
                {
                    maxlen = list[];
                    position = ;
                }
            }
            if (list[list.Count - ] != len - )
            {
                if (maxlen < len - list[list.Count - ] - )
                {
                    maxlen = len - list[list.Count - ] - ;
                    position = len - ;
                }
            }

            return maxlen;
        }
    }