71. Simplify Path

题目描述:对Unix-style的路径进行简化,得到简化的路径

难点:不知道如何简化,要多试用例

解题的思路:对string遍历,./表示当前路径,../表示退回上级目录,///归纳为1个,....等直接复制。还有就是对路径末尾进行处理,不包括/


public class Solution {
    public string SimplifyPath(string path) {
List<char> simplifiedPath = new List<char>();
            char[] absolutePath = path.ToCharArray();
            for (int i = 0; i < absolutePath.Length; i++)
            {
                if (i <= absolutePath.Length - 1 && absolutePath[i] == '.')
                {
                    if (i==absolutePath.Length-1||absolutePath[i + 1] == '/')
                    {
                            i++;
                            while (i < absolutePath.Length && absolutePath[i] == '/')
                            {
                                i++;
                            }
                            i--;
                    }
                    else if ((i < absolutePath.Length - 2 && absolutePath[i + 1] == '.' && absolutePath[i + 2] == '/') || (i == absolutePath.Length - 2 && absolutePath[i + 1] == '.'))
                    {
                        if (simplifiedPath.Count > 1)
                            simplifiedPath.RemoveAt(simplifiedPath.Count - 1);
                        int last = simplifiedPath.LastIndexOf('/');
                        if (last >= 0&&simplifiedPath.Count>=2)
                            simplifiedPath.RemoveRange(last + 1, simplifiedPath.Count - last - 1);
                        i += 2;
                        while (i < absolutePath.Length && absolutePath[i] == '/')
                            {
                                i++;
                            }
                            i--;
                    }
                    else
                    {
                        while (i<absolutePath.Length&&absolutePath[i] == '.')
                        {
                            simplifiedPath.Add(absolutePath[i]);
                            i++;
                        }
                        i--;
                        
                    }
                }
                else if (i < absolutePath.Length - 1 && absolutePath[i] == '/' && absolutePath[i + 1] == '/')
                {
                    simplifiedPath.Add(absolutePath[i]);
                    while (i < absolutePath.Length && absolutePath[i] == '/')
                    {
                        i++;
                    }
                    i--;
                }
                else
                    simplifiedPath.Add(absolutePath[i]);
            }
            int k = 0;
            for (int i = simplifiedPath.Count - 1; i > 0; i--)
            {
                if (simplifiedPath[i] != '/' )
                {
                    k = i;
                    break;
                }
            }
            if (k < simplifiedPath.Count - 1)
                simplifiedPath.RemoveRange(k + 1, simplifiedPath.Count - k - 1);
            return new string(simplifiedPath.ToArray());
    }
}

  • 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、付费专栏及课程。

余额充值