| | |
| | | */ |
| | | public class RouteUtils { |
| | | |
| | | //问题2 周俊杰 |
| | | public static final List<Integer> MERGE_STA_NO_One = new ArrayList<Integer>() {{ |
| | | // add(116);add(117); |
| | | add(113);add(119); |
| | | }}; |
| | | |
| | | public static final List<Integer> MERGE_STA_NO_TWO = new ArrayList<Integer>() {{ |
| | |
| | | return getRouteIntersection(getRoute(a, c), getRoute(b, c), RouteCollectCountType.DEDUPLICATIONUNION); |
| | | } |
| | | |
| | | public static Short CrnStaEnd(Integer endSta,Integer souSta) { |
| | | switch (endSta) { |
| | | case 100: |
| | | if (souSta == 118){ |
| | | return (short)119; |
| | | } |
| | | return (short)149; |
| | | case 102: |
| | | case 111: |
| | | return 149; |
| | | default: |
| | | return endSta.shortValue(); |
| | | } |
| | | } |
| | | |
| | | public static Short SouStaEnd(Integer endSta,Integer souSta){ |
| | | if (souSta == 159) { |
| | | return (short)161; |
| | | } |
| | | return souSta.shortValue(); |
| | | } |
| | | |
| | | |
| | | |
| | | public static void main(String[] arge){ |