<rt id="bn8ez"></rt>
<label id="bn8ez"></label>

  • <span id="bn8ez"></span>

    <label id="bn8ez"><meter id="bn8ez"></meter></label>

    Java Votary

      BlogJava :: 首頁 :: 新隨筆 :: 聯系 :: 聚合  :: 管理 ::
      48 隨筆 :: 1 文章 :: 80 評論 :: 0 Trackbacks
    Google編程大賽入圍賽250分真題


    Problem Statement
    ????
    You are given a String[] cityMap representing the layout of a city. The city
    consists of blocks. The first element of cityMap represents the first row of
    blocks, etc. A 'B' character indicates a location where there is a bus stop.
    There will be exactly one 'X' character, indicating your location. All other
    characters will be '.'. You are also given an int walkingDistance, which is the
    maximum distance you are willing to walk to a bus stop. The distance should be
    calculated as the number of blocks vertically plus the number of blocks
    horizontally. Return the number of bus stops that are within walking distance of
    your current location. Definition
    ????
    Class:
    BusStops
    Method:
    countStops
    Parameters:
    String[], int
    Returns:
    int
    Method signature:
    int countStops(String[] cityMap, int walkingDistance)
    (be sure your method is public)
    ????

    Constraints
    -
    cityMap will contain between 1 and 50 elements, inclusive.
    -
    Each element of cityMap will contain between 1 and 50 characters, inclusive.
    -
    Each element of cityMap will contain the same number of characters.
    -
    Each character of each element of cityMap will be 'B', 'X', or '.'.
    -
    There will be exactly one 'X' character in cityMap.
    -
    walkingDistance will be between 1 and 100, inclusive.
    Examples
    0)

    ????
    {"...B.",
     ".....",
     "..X.B",
     ".....",
     "B...."}
    3
    Returns: 2
    You can reach the bus stop at the top (3 units away), or on the right (2 units
    away). The one in the lower left is 4 units away, which is too far. 1)

    ????
    {"B.B..",
     ".....",
     "B....",
     ".....",
     "....X"}
    8
    Returns: 3
    A distance of 8 can get us anywhere on the map, so we can reach all 3 bus stops.
    2)

    ????
    {"BBBBB",
     "BB.BB",
     "B.X.B",
     "BB.BB",
     "BBBBB"}
    1
    Returns: 0
    Plenty of bus stops, but unfortunately we cannot reach any of them.
    3)

    ????
    {"B..B..",
     ".B...B",
     "..B...",
     "..B.X.",
     "B.B.B.",
     ".B.B.B"}
    3
    Returns: 7

    This problem statement is the exclusive and proprietary property of TopCoder,
    Inc. Any unauthorized use or reproduction of this information without the prior
    written consent of TopCoder, Inc. is strictly prohibited. (c)2003, TopCoder,
    Inc. All rights reserved.

    posted on 2005-12-15 13:14 Dion 閱讀(1192) 評論(0)  編輯  收藏 所屬分類: Java
    主站蜘蛛池模板: www成人免费观看网站| 亚洲精品V天堂中文字幕| 国产精品内射视频免费| 亚洲国产精品激情在线观看| 亚洲 欧洲 日韩 综合在线| 亚洲一级免费毛片| 亚洲三级视频在线观看| 国产在线观看片a免费观看| 亚洲成a人片77777群色| 永久免费毛片在线播放| 亚洲伊人久久大香线蕉影院| 曰曰鲁夜夜免费播放视频 | 色www永久免费视频| 亚洲AV综合永久无码精品天堂| 日韩成人免费aa在线看| 香蕉97碰碰视频免费| 亚洲精品无码专区久久同性男| 一区二区三区免费视频播放器 | 噜噜噜亚洲色成人网站∨| 91青青国产在线观看免费| ass亚洲**毛茸茸pics| 四虎永久免费网站免费观看| 一区二区免费在线观看| 亚洲国产精品无码一线岛国| 天天影视色香欲综合免费| 亚洲av永久中文无码精品综合 | 91精品国产免费久久久久久青草| 亚洲AV综合色区无码二区爱AV| 日韩高清在线免费看| 91免费在线视频| 亚洲成人免费在线观看| 日韩亚洲精品福利| 久久综合九色综合97免费下载| 亚洲国产成人精品无码区在线秒播| 日韩免费观看的一级毛片| 四虎影视无码永久免费| 亚洲偷偷自拍高清| 亚洲人成电影网站国产精品| aⅴ免费在线观看| 四虎国产精品成人免费久久| 亚洲短视频在线观看|