emu in blogjava

            BlogJava :: 首頁 :: 新隨筆 :: 聯系 :: 聚合  :: 管理 ::
            171 隨筆 :: 103 文章 :: 1052 評論 :: 2 Trackbacks

          考試剛剛結束,題目帖出來交流一下。
          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-13 12:00 emu 閱讀(1057) 評論(2)  編輯  收藏 所屬分類: google編程大賽模擬題及入圍賽真題

          評論

          # emu解 BusStops 2005-12-13 14:23 emu
          public class BusStops
          {
          public int countStops(String[] cityMap, int walkingDistance){
          int x=-1,y=-1,result=0;
          for(int i=0;i<cityMap.length;i++){
          if(cityMap[i].indexOf("X")>-1){
          y=i;x=cityMap[i].indexOf("X");
          break;
          }
          }
          for(int i=0;i<cityMap.length;i++){
          String s = cityMap[i];
          for(int j=0;j<s.length();j++){
          if(s.charAt(j)=='B'){
          int a= Math.abs(y-i)+Math.abs(x-j);
          if(a<=walkingDistance) result++;
          }
          }
          }
          return result;
          }
          public static void main(String[] args)
          {
          BusStops b = new BusStops();
          System.out.println(b.countStops( new String[]{"...B.",".....","..X.B",".....","B...."},3));
          System.out.println(b.countStops( new String[]{"B.B..",".....","B....",".....","....X"},8));
          System.out.println(b.countStops( new String[]{"BBBBB","BB.BB","B.X.B","BB.BB","BBBBB"},1));
          System.out.println(b.countStops( new String[]{"B..B..",".B...B","..B...","..B.X.","B.B.B.",".B.B.B"},3));
          }
          }  回復  更多評論
            

          # re: google中國編程挑戰(zhàn)賽資格賽真題 -- BusStops(250分) 2005-12-18 17:46 guest
          for(int i=0;i<cityMap.length;i++){
          String s = cityMap[i];
          for(int j=0;j<s.length();j++){

          i,j的起點可縮小,不過這是250分的,就別計較了,呵呵  回復  更多評論
            

          主站蜘蛛池模板: 甘德县| 甘谷县| 大余县| 五家渠市| 义乌市| 顺平县| 石柱| 广元市| 大连市| 沙洋县| 宝山区| 自治县| 綦江县| 吴桥县| 沾化县| 固原市| 二连浩特市| 清新县| 贺兰县| 馆陶县| 平顺县| 新邵县| 茌平县| 诏安县| 汝南县| 电白县| 大余县| 宣恩县| 寿宁县| 介休市| 云林县| 琼海市| 武汉市| 长子县| 峨眉山市| 新干县| 安宁市| 象山县| 小金县| 东海县| 华容县|