leetcode 1143 最长公共子序列
难点在于保持相对顺序
class Solution:def longestCommonSubsequence(self, text1: str, text2: str) -> int:dp [[0] * (len(text2) 1) for i in range(len(text1) 1)]for i in range(1, len(text1) 1):for j in range(1, len(text2) …
1.MobaXterm
这个软件方面粘贴,文件拷贝 MobaXterm mkdir esp32 cd esp32 git clone https://gitee.com/EspressifSystems/esp-gitee-tools.git cd esp-gitee-tools ./jihu-mirror.sh set cd .. git clone --recursive https://github.com/espressif/esp-idf.git cd esp-i…