删除 'c_cpp/id_rsa.pub'

c_cpp/fileio.py

@@ -1,26 +0,0 @@
-from typing import List
-class Solution:
-    
-    def merge(self, intervals: List[List[int]]) -> List[List[int]]:
-        intervals.sort()
-        outp = []
-        inlen =len(intervals)
-        curli = intervals[0]
-        if inlen == 1:
-            return intervals
-        else:
-            for i in range(1,inlen):
-                if intervals[i][0] > curli[1]:
-                    outp.append(curli)
-                    curli = intervals[i]
-                    continue
-                else:
-                    if intervals[i][1] >curli[1]:
-                        curli[1] = intervals[i][1]
-            outp.append(curli)
-            outp.sort()
-            return outp
-            
-                
-
-

c_cpp/id_rsa.pub

@@ -1 +0,0 @@
-ssh-rsa AAAAB3NzaC1yc2EAAAADAQABAAABgQD9iADhugWA20YFU9+3zLPUmXe3HEMiQCPBDOFguPKSFcn9nbgxIDENeyTEjaIMShISHw4pj5RQ0tKeSfBAD9DtEPIRQcCfWnwU4TtF2UEwn31pxd1VrAnlN9RShv0FQ8LKPgoZ8uge8EsVku6BawilbxLCi0xcctvIRyDccErxUoArwbEnWRAx6gitRUwvqx8iEIwGkEr4Woer022XCVbfTMI6X5mnRyrlcAg2iJyv5Tbz7s+ugl7ZMt7Tt2jUOvnl2BmxtWbxUjiSDiIhVM/P7J1nDwUczjICl6PI+2iaRu2GOUkQMSBY5Uf+dEfVH+6XAJ18KzE/ozPO9NT6vEypBP9D0W+T0eMXDaetTT4rakq9Mv6nFGJOIO6ZU0TmcpUoK0ZaTiVB/+YMFbiW+o9qcSG0i52b5wNNiyieaIN74gAoVTbG4rVz9Xa8ExccMnvzY+rQuW5JvIKtsJPSAqYKoBYHCgQmWv8/6YODFARdrNsiZSADGVr6D0cZ8Y4xE4k= 邮箱名称

cppfile/test3.cpp

@@ -1,95 +0,0 @@
-#include<stdio.h>
-#include<math.h>
-#include<string.h>
-#include <iostream>     // cout
-#include <algorithm>    // find
-#include <vector>       // vector
-#include<string>
-
-using namespace std;
-int findsame(char ip,char com[]){
-    int lengt;
-    lengt = sizeof(com);
-    for (int i = 0; i<lengt; i++){
-        if(ip == com[i]){
-            return 1;
-            break;
-        }
-        else{
-            return 0;
-        }
-    }
-}
-int main(){
-    int num;
-    char resu[3][14];
-    vector<char> d1[11];
-    char common[11];
-    int *p;
-    int *q;
-    int oi = 0;
-    int budeng;
-    scanf("%d",&num);
-    for (int i = 0;i<num;i++){
-        for(int j=0;j<4;j++){
-            gets(resu[j]);
-        }
-        for(int k = 1;k <= 3;k++){
-            if (resu[k][10] == 'e'){
-                while(oi < 4 ){
-                    p = find(d1->begin(),d1->end(),resu[k][oi]);
-                    if (p !=d1->end){
-                        continue;
-                    }
-                    else{
-                        d1->push_back(resu[k][oi])
-                    }
-                    oi++;
-                }
-                for (int secp = 5;secp < 9;secp++){
-                    p = find(d1->begin(),d1->end(),resu[k][secp]);
-                    if (p !=d1->end){
-                        continue;
-                    }
-                    else{
-                        d1->push_back(resu[k][secp])
-                    }
-                }
-            }
-            else{
-                budeng = k;
-                continue;
-            } 
-            }    
-            }
-        for (int fp = 0;fp<4;fp++){
-            q = find(d1->begin(),d1->end(),resu[budeng][fp]);
-            if (q != d1->end){
-                if(resu[budeng][9] == 'u'){
-                    printf('%c is the counterfeit coin and it is light.',resu[budeng][fp]);
-                }
-                else{
-                    printf('%c is the counterfeit coin and it is heavy.',resu[budeng][fp]);
-                }
-
-                break;
-            }
-            
-        }
-        for (int fp1 = 5;fp1<9;fp1++){
-            q = find(d1->begin(),d1->end(),resu[budeng][fp1]);
-            if (q != d1->end){
-                 if(resu[budeng][9] == 'u'){
-                    printf('%c is the counterfeit coin and it is heavy.',resu[budeng][fp1]);
-                }
-                else{
-                    printf('%c is the counterfeit coin and it is light.',resu[budeng][fp1]);
-                }
-                break;
-            }
-            
-        }
-        
-        
-        }
-