71. Simplify Path

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

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

click to show corner cases.

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".
題意:

簡化路徑(Unix路徑表示),例如:

path = "/home/", => "/home"

path = "/a/./b/../../c/", => "/c"

題解:

將path以"/"來切割文件夾名稱,並歷遍所有文件夾名稱,在歷遍過程中,利用stack紀錄路徑,有下面幾種情況:

  1. 遇到".",略過這個文件夾名稱
  2. 遇到"..",將stack排出一個文件夾名稱
  3. 遇到其他字符串則將該字符串加入stack當中
然後再將stack全部排出,用以組成簡化過的路徑名稱。
*注意coner case*
package LeetCode.Medium;
import java.util.Stack;

public class SimplifyPath {
    public String simplifyPath(String path) {
        if(path == null || path.length() == 0) {
            return "/";
        }
        
        //將路徑以"/"的方式進行切割,切出每個文件夾的名稱
        String[] names = path.split("/");
        Stack<String> stack = new Stack<>();
        
        //歷遍所有文件夾的名稱
        for(int i = 0; i < names.length; i ++) {
            //若遇到"."則可以略過(相同文件夾)
            if(names[i].equals(".") == true || names[i].equals("")) {
                continue;
            }
            
            //若遇到".."則可以推出一個文件夾(上一個文件夾)
            if(names[i].equals("..") == true) {
                //需要避免stack為空的情況
                if(stack.isEmpty() == false) {
                    stack.pop();
                }
            //其他情況則可以添加文件夾
            } else {
                stack.push(names[i]);
            }
        }
        
        //若stack為空,可以直接輸出結果
        if(stack.isEmpty() == true) {
            return "/";
        }
        
        //開始進行結果的拼接
        String result = "";
        int i = 0;
        while(stack.isEmpty() == false) {
            String folder_name = stack.pop();
            //首個文件夾前面不加"/",到最後才添加,避免混亂
            if(i == 0) {
                result = folder_name;
            } else {
                result = folder_name + "/" +result;
            }
            i ++;
        }
        
        //在首個文件夾名稱前面添加"/"
        result = "/" + result;
        
        return result;
    }
}

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
优化代码 def fault_classification_wrapper(vin, main_path, data_path, log_path, done_path): start_time = time.time() isc_path = os.path.join(done_path, vin, 'isc_cal_result', f'{vin}_report.xlsx') if not os.path.exists(isc_path): print('No isc detection input!') else: isc_input = isc_produce_alarm(isc_path, vin) ica_path = os.path.join(done_path, vin, 'ica_cal_result', f'ica_detection_alarm_{vin}.csv') if not os.path.exists(ica_path): print('No ica detection input!') else: ica_input = ica_produce_alarm(ica_path) soh_path = os.path.join(done_path, vin, 'SOH_cal_result', f'{vin}_sohAno.csv') if not os.path.exists(soh_path): print('No soh detection input!') else: soh_input = soh_produce_alarm(soh_path, vin) alarm_df = pd.concat([isc_input, ica_input, soh_input]) alarm_df.reset_index(drop=True, inplace=True) alarm_df['alarm_cell'] = alarm_df['alarm_cell'].apply(lambda _: str(_)) print(vin) module = AutoAnalysisMain(alarm_df, main_path, data_path, done_path) module.analysis_process() flags = os.O_WRONLY | os.O_CREAT modes = stat.S_IWUSR | stat.S_IRUSR with os.fdopen(os.open(os.path.join(log_path, 'log.txt'), flags, modes), 'w') as txt_file: for k, v in module.output.items(): txt_file.write(k + ':' + str(v)) txt_file.write('\n') for x, y in module.output_sub.items(): txt_file.write(x + ':' + str(y)) txt_file.write('\n\n') fc_result_path = os.path.join(done_path, vin, 'fc_result') if not os.path.exists(fc_result_path): os.makedirs(fc_result_path) pd.DataFrame(module.output).to_csv( os.path.join(fc_result_path, 'main_structure.csv')) df2 = pd.DataFrame() for subs in module.output_sub.keys(): sub_s = pd.Series(module.output_sub[subs]) df2 = df2.append(sub_s, ignore_index=True) df2.to_csv(os.path.join(fc_result_path, 'sub_structure.csv')) end_time = time.time() print("time cost of fault classification:", float(end_time - start_time) * 1000.0, "ms") return
最新发布
05-28
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值