Java Votary

            BlogJava :: 首頁 :: 新隨筆 :: 聯(lián)系 :: 聚合  :: 管理 ::
            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 閱讀(1200) 評論(0)  編輯  收藏 所屬分類: Java
          主站蜘蛛池模板: 桦甸市| 永宁县| 通海县| 梁平县| 鄯善县| 昌黎县| 太保市| 马山县| 富锦市| 南岸区| 抚宁县| 鸡西市| 莱州市| 赣榆县| 博爱县| 垦利县| 安图县| 侯马市| 象山县| 西贡区| 香港 | 江安县| 原阳县| 桦川县| 汝州市| 武强县| 福鼎市| 岫岩| 汉寿县| 安达市| 营山县| 宁国市| 清徐县| 仁化县| 阿瓦提县| 海口市| 南平市| 北海市| 缙云县| 乐清市| 崇明县|