Go语言实现Directions Reduction

描述

Once upon a time, on a way through the old wild west,…
… a man was given directions to go from one point to another. The directions were “NORTH”, “SOUTH”, “WEST”, “EAST”. Clearly “NORTH” and “SOUTH” are opposite, “WEST” and “EAST” too. Going to one direction and coming back the opposite direction is a needless effort. Since this is the wild west, with dreadfull weather and not much water, it’s important to save yourself some energy, otherwise you might die of thirst!
How I crossed the desert the smart way.
The directions given to the man are, for example, the following:
{ “NORTH”, “SOUTH”, “SOUTH”, “EAST”, “WEST”, “NORTH”, “WEST” };
You can immediatly see that going “NORTH” and then “SOUTH” is not reasonable, better stay to the same place! So the task is to give to the man a simplified version of the plan. A better plan in this case is simply:
{ “WEST” }
Other examples:
In [“NORTH”, “SOUTH”, “EAST”, “WEST”], the direction “NORTH” + “SOUTH” is going north and coming back right away. What a waste of time! Better to do nothing.
The path becomes [“EAST”, “WEST”], now “EAST” and “WEST” annihilate each other, therefore, the final result is [] (nil in Clojure).
In [“NORTH”, “EAST”, “WEST”, “SOUTH”, “WEST”, “WEST”], “NORTH” and “SOUTH” are not directly opposite but they become directly opposite after the reduction of “EAST” and “WEST” so the whole path is reducible to [“WEST”, “WEST”].
Task
Write a function dirReduc which will take an array of strings and returns an array of strings with the needless directions removed (W<->E or S<->N side by side).
Notes
Not all paths can be made simpler. The path [“NORTH”, “WEST”, “SOUTH”, “EAST”] is not reducible. “NORTH” and “WEST”, “WEST” and “SOUTH”, “SOUTH” and “EAST” are not directly opposite of each other and can’t become such. Hence the result path is itself : [“NORTH”, “WEST”, “SOUTH”, “EAST”].

分析

方法1：
利用辅助slice。遇到与前一项相反的方向，就将辅助slice最后一项删除。否则向辅助slice追加。
方法2：
直接操作原有slice。

实现

方法1：

func DirReduc(arr []string) (s []string) {
  m := map[string]string{
    "NORTH": "SOUTH",
    "SOUTH": "NORTH",
    "EAST": "WEST",
    "WEST": "EAST", // NOTE 1
  }
  for _, v := range arr {
    if len(s) > 0 && m[v] == s[len(s)-1] {
      s = s[:len(s)-1]
    } else { s = append(s, v) }
  }
  return
}

注1：map最后一项的’,'不可或缺。
方法2：

func DirReduc(arr []string) []string {
  m := map[string]string{
    "NORTH": "SOUTH",
    "SOUTH": "NORTH",
    "EAST": "WEST",
    "WEST": "EAST",
  }
  var i = 0
  for j := 0; j < len(arr); j++ {
    if i > 0 && arr[i-1] == m[arr[j]] {
      i--
    } else {
      arr[i] = arr[j]
      i++
    }
  }
  if i == 0 { return []string{ "" } }
  return arr[:i]
}