vmturbo 机经

1.You're asked to write a controller for a sorting machine for Christmas decorations.  
Decorations arrive at the scanner, and the percentages of red and green are reported.  
Your must write a program that sorts the decorations into one of three bins:

Red, if the decoration is more than 35% red
Green, if the decoration is more than 30% green
Reject, if the decoration is both more than 35% red and 30% green - these are just too "loud".

The interfaces you have are the following:

interface ScannerAndSorter {
        // Read and scan another item; return false when there are no more
        // items.
        bool nextItem();

        // Percentage (0-100) of the current item that's red.
        double redPercentage();

        // Percentage (0-100) of the current item that's green.
        double greenPercentage();

        // Send the current item to the Red bin
        void sendToRed();

        // Send the current item to the Green bin
        void sendToGreen();

        // Send the current item to the Reject bin
        void reject();
}

class DecorationSorter {
        ScannerAndSorter sorter;

        public DecorationSorter(ScannerAndSorter sorter) {
                this.sorter = sorter;
        }

        // Sort the decorations that 'sorter' reads.
        void sort() {
                ... fill this in ...
        }
}


Implement the sort() function.

2.A maze is a group of linked Places.  Each Place has a North, South, East, and West Place adjacent to it.  There are two special pre-defined Place's:  
Place Wall represents a wall - the mouse can't go there.  Place Cheese is ... cheese!   The connections between Places are symmetrical - if you start
from any Place and go North and then South, you return to where you were.  To simplify things, the maze has no closed loops - that is, if you start in
any Place and follow any path, yo

您好！
本帖隐藏的内容需要积分高于 188 才可浏览
您当前积分为 0。
使用VIP即刻解锁阅读权限或查看其他获取积分的方式

游客，您好！
本帖隐藏的内容需要积分高于 188 才可浏览
您当前积分为 0。
VIP即刻解锁阅读权限 或 查看其他获取积分的方式

int, will reach a Place where isCheese() is
  // true.  Return null if you can't find such a path.
  public String findCheese(Place startingPoint) {
        ... fill this in ...
  }
}

Implement findCheese().  You can add any fields or helper methods you need to Mouse.


Extra credit:  Eliminate the "no closed loops" restriction.  That is, change
your code so that it works correctly even if there might be a path like SSNEEW that leads the mouse back to the Place it started from.

woshiee123 发表于 2015-4-19 02:09
那item的class 也没给么 ？item就是item.color 么？ 需要一个变量sum么？还是不用自己算 直接有百分比

interface 里的方法都可以直接用，没有满足的条件就 nextItem。直接用给的方法，不用考虑具体是怎么实现的

ice9123 发表于 2015-4-19 21:28
interface 里的方法都可以直接用，没有满足的条件就 nextItem。直接用给的方法，不用考虑具体是怎么实现 ...

可以用c++么 还是必须用java

ice9123 发表于 2015-4-19 01:26
什么都不做

那item的class 也没给么 ？item就是item.color 么？ 需要一个变量sum么？还是不用自己算 直接有百分比

问下这个题如果第一个item 即《35red 也小于30 green 如何操作 ？

woshiee123 发表于 2015-4-18 23:11
问下这个题如果第一个item 即《35red 也小于30 green 如何操作 ？

什么都不做

woshiee123 发表于 2015-4-19 22:07
可以用c++么 还是必须用java

这个OA是要编译通过的么

woshiee123 发表于 2015-4-20 23:05
这个OA是要编译通过的么

不需要，就是一个写字板

楼主有消息了么？

ffcc 发表于 2015-4-28 08:07
楼主有消息了么？

没有，一个多月了。估计是跪了