codewar-010: Directions Reduction

最新推荐文章于 2024-08-08 14:30:51 发布

weixin_33806509

最新推荐文章于 2024-08-08 14:30:51 发布

阅读量127

点赞数

文章标签： java python

原文链接：https://my.oschina.net/u/553266/blog/802532

版权

2019独角兽企业重金招聘Python工程师标准>>>

https://www.codewars.com/kata/550f22f4d758534c1100025a/train/java

package codewar;
import java.util.*;
public class DirReduction{
  public static String[] dirReduc(String[] arr){
    List<String> list = new ArrayList<String>();
    for(String x : arr){
      list.add(x);
    }
    while(true){
      int len = list.size();
      for(int I = 0; I < list.size() - 1; i++){
        if("NORTH".equals(list.get(i)) && "SOUTH".equals(list.get(i+1))||
           "SOUTH".equals(list.get(i)) && "NORTH".equals(list.get(i+1))||
           "EAST".equals(list.get(i)) && "WEST".equals(list.get(i+1))||
           "WEST".equals(list.get(i)) && "EAST".equals(list.get(i+1))){
          list.remove(i);
          list.remove(i);
          break;
        }   
      } 
      if( len == list.size()){
        break;
      }
    }
     return list.toArray(new String[0]);
  }
}

转载于:https://my.oschina.net/u/553266/blog/802532