全部评论
so easy五分钟搞定🤣🤣 #include <iostream>
#include <algorithm>
#include <vector>
#include<string>
using namespace std;
int main()
{
string sentence, sensitive;
while (cin >> sentence >> sensitive)
{
int sizeA = sentence.length();
int sizeB = sensitive.length();
int position;
position = sentence.find(sensitive);
if (position != -1)
{
string instead(sizeB, 0);
for (int i = 0; i < sizeB; i++)
{
instead[i] = '*';
}
sentence.replace(position, sensitive.length(), instead);
cout << sentence << endl;
}
else
cout << sentence << endl;
}
}
leetcode 28
def strStr(self, haystack: str, needle: str) -> int:
if not needle:
return 0
for i in range(len(haystack)-len(needle)+1):
if haystack[i:i+len(needle)]==needle:
return i
return -1
flag=strStr(s1,s2)
if flag==-1:
print(s1)
else:
print(s1[:flag]+len(s2)*"*"+s1[len(s2)+flag:])
a = list(input().split())
s = a[0]
t = a[1]
ss=''
for i in range(len(t)):
ss=ss+'*'
print(s.replace(t,ss))
import java.util.*;
public class Main{
public static void main(String[] args){
Scanner sc = new Scanner(System.in);
String input = sc.next();
String illegal = sc.next();
StringBuilder legal = new StringBuilder();
for(int i = 0; i <= illegal.length() - 1; i++) {
legal.insert(i, '*');
}
System.out.println(input.replace(illegal, legal));
}
}
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
String[] inputs = sc.nextLine().split(" ");
String unCheck = inputs[0];
char[] unCheckChars = unCheck.toCharArray();
String target = inputs[1];
if (!unCheck.contains(target)) {
System.out.println(unCheck);
} else {
int l = unCheck.indexOf(target);
int r = l + target.length();
for (int i = l; i < r; i++) {
unCheckChars[i] = '*';
}
StringBuilder sb = new StringBuilder();
for (int i = 0; i < unCheckChars.length; i++) {
sb.append(unCheckChars[i]);
}
System.out.println(sb.toString());
}
}
}
我也是为什么才80
相关推荐
10-19 18:20
福建师范大学 Java
下午吃泡馍:数字马力的薪资一般哇,5年经验的java/测试就给人一万出头,而且刚入职第三天就让人出差,而且是出半年
帮你内推|数字马力 校招 点赞 评论 收藏
分享
点赞 评论 收藏
分享
查看15道真题和解析