emu in blogjava

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

          考試剛剛結(jié)束,題目帖出來交流一下。
          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 閱讀(1048) 評論(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));
          }
          }  回復(fù)  更多評論
            

          # 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分的,就別計較了,呵呵  回復(fù)  更多評論
            

          主站蜘蛛池模板: 进贤县| 甘谷县| 韩城市| 寿阳县| 宣化县| 侯马市| 中宁县| 巩义市| 肃宁县| 阜南县| 富宁县| 辽宁省| 汶上县| 新竹县| 石城县| 信丰县| 枝江市| 荥阳市| 临沭县| 昆山市| 抚州市| 嵊泗县| 休宁县| 新宾| 威信县| 桐梓县| 张家川| 拜城县| 商丘市| 怀化市| 温州市| 永宁县| 西昌市| 肇州县| 丰原市| 德庆县| 金平| 阿拉善左旗| 临洮县| 胶州市| 汕尾市|