anjouwins的博客

question1 leetcode第一题遇到unordered_map class Solution { public: int findY(int x, int target){ if(x == 0) return target; if(target == 0) return -x; else{ if(x == target) return 0; else return -x + target...

leetcode第三题 class Solution { public: int lengthOfLongestSubstring(string s) { int i=0,j=1; int length=1; int max=1; while (s.length()==0) return 0; unordered_map<char,int> bank; while(i!=s.lengt...

将各种分隔符改为， def replace(line): print(“replacing…”) if ‘##’ in line: outstr = line.replace(’##’, ‘,’) # 字符串##可以改为你要处理的文件中的分隔符 return outstr filename = ‘/home/anjou/aa/secondattempt.txt’ ...