leetcode #71 in cpp

原创 2016年05月31日 09:45:25

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

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

Solution:

Rules could be found in wiki. 

1. when we meet "..", delete its adjacent left folder

2. when we meet ".", do nothing. Just skip it. 

3. when we meet '/', it means we meet a new folder or the end of current folder.

Code:

class Solution {
public:
    string simplifyPath(string path) {
        vector<string> stk;
        int start_ind = -1;
        
        int i = 0;
        while(i<path.size()){
            //collect strings between '/'  and '/'
            while(i<path.size() &&path[i] == '/' ) i++;//skip leading /
            if(i == path.size()) break;
                start_ind = i;
            while(i<path.size() &&path[i] != '/' ) i++;//get the following characters
            i--;
            
            //get substring
            string s = path.substr(start_ind, i - start_ind+1);
            if(s == ".") {//if it is "".", do nothing
                i++;
                continue;
            } 
            else if(s == ".."){//if it is "..", we need to delete its left
                    if(!stk.empty()) stk.pop_back();
                }else{
                    stk.push_back(s);//if it is a path, push it.
                }
            i++;   
        }
        if(stk.empty()) return "/";
        string res = "";
        for(int i = 0; i < stk.size(); i ++){
            res+="/"+stk[i];
        }
        return res;
                        
            
        }
        
};


版权声明:本文为博主原创文章,未经博主允许不得转载。

相关文章推荐

leetcode #36 in cpp.

The question is to determine a Sudoku is valid.  Solution:  if a Sudoku is valid, each row, each co...

leetcode #28 in cpp

This one is to find a pattern string in a text string. Most of solutions use std::find() but I would...

leetcode #57 in cpp

Given a set of non-overlapping intervals, insert a new interval into the intervals (merge if necessa...

*leetcode 138 in cpp

A linked list is given such that each node contains an additional random pointer which could point t...

leetcode #17 in cpp

The question is : Given a digit string, return all possible letter combinations that the number coul...

leetcode #97 in cpp

Given s1, s2, s3, find whether s3 is formed by the interleaving of s1 and s2. For example, Given...

leetcode #34 in cpp

Given a sorted array of integers, find the starting and ending position of a given target value. ...

leetcode #73 in cpp

Given a m x n matrix, if an element is 0, set its entire row and column to 0. Do it in place. Soluti...

leetcode $42 in cpp

Code: (This method is not the best one. There are other methods using two pointers) Key: a bar coul...

*leetcode #80 in cpp

Follow up for "Remove Duplicates": What if duplicates are allowed at most twice? For example, G...
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:深度学习:神经网络中的前向传播和反向传播算法推导
举报原因:
原因补充:

(最多只允许输入30个字)