【leetcode】Simplify Path

Given an absolute path for a file (Unix-style), simplify it.

For example,
path = "/home/", => "/home"
path = "/a/./b/../../c/", => "/c"

Corner Cases:

  • Did you consider the case where path = "/../"?
    In this case, you should return "/".
  • Another corner case is the path might contain multiple slashes '/' together, such as "/home//foo/".
    In this case, you should ignore redundant slashes and return "/home/foo".

Accept: 3ms
思路:将 path 按 "/" 进行 split,然后放入 stack中:
  • 遇到 ".." 则从stack中弹出一个元素(注意stack为空情况);
  • 遇到 "." 或者空("//" 的case),忽略;
  • 其他情况将 字符串压入stack中。
然后从 bottom到top输出stack。

struct Part {
  char *s;
  size_t len;
  struct Part *next;
};

struct Part* split(char* path) {
  struct Part *head = NULL;
  struct Part *p = NULL;
  ++path;
  char *s = strchr(path, '/');
  while (s != NULL) {
    if (head == NULL) {
      head = malloc(sizeof(struct Part));
      p = head;
    } else {
      p->next = malloc(sizeof(struct Part));
      p = p->next;
    }
    p->s = path;
    p->len = s - path;
    p->next = NULL;

    path = s + 1;
    s = strchr(path, '/');
  }
  if (head == NULL) {
    head = malloc(sizeof(struct Part));
    p = head;
  } else {
    p->next = malloc(sizeof(struct Part));
    p = p->next;
  }
  p->s = path;
  p->len = strlen(path);
  p->next = NULL;
  
  return head;
}

char* simplifyPath(char* path) {
  struct Part* head = split(path);

  const int MAX_PATH = 1000;
  struct Part* stack[MAX_PATH];
  int n = 0;

  while (head != NULL) {
    struct Part* next = head->next;
    if (head->len == 2 && strncmp(head->s, "..", 2) == 0) {
      if (n > 0) {
        free(stack[--n]);
      }
      free(head);
    } else if (head->len == 0 || (head->len == 1 && head->s[0] == '.')) {
      free(head);
    } else {
      stack[n++] = head;
    }
    head = next;
  }
  
  char* rst = malloc(strlen(path) + 1);
  char* p = rst;
  for (int i = 0; i < n; ++i) {
    *p++ = '/';
    memcpy(p, stack[i]->s, stack[i]->len);
    p += stack[i]->len;
    free(stack[i]);
  }
  if (p == rst) {
    *p++ = '/';
    *p = '\0';
  } else {
    *p = '\0';
  }

  return rst;
}


  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值