JAVA方向笔试强训-day19

最新推荐文章于 2024-09-09 19:10:22 发布

Wukong.Sun

最新推荐文章于 2024-09-09 19:10:22 发布

阅读量177

点赞数

分类专栏： JAVA方向48天笔试强训文章标签：数据结构

本文链接：https://blog.csdn.net/weixin_65528013/article/details/127757451

版权

JAVA方向48天笔试强训专栏收录该内容

17 篇文章 0 订阅

订阅专栏

一.编程题

汽水瓶_牛客题霸_牛客网 (nowcoder.com)

public class Main
{
public static int getNum(int num)
{
//累加汽水的个数
int sum = 0;
//while(num > 0) 死循环
while(num > 1)
{
//兑换的汽水的个数 /3
sum += num / 3;
//剩余的空瓶子 /3 + %3
num = num / 3 + num % 3;
if(num == 2)
{
//借一瓶
++sum;
break;
}

}
return sum;
}
public static void main(String[] args)
{
Scanner s = new Scanner(System.in);
int num;
while((num = s.nextInt()) != 0)
{
System.out.println(getNum(num));
}
}
}

查找两个字符串a,b中的最长公共子串_牛客题霸_牛客网 (nowcoder.com)

好难！摆烂了，专注力不够，题解都40多分钟，下次再看吧hhh


public class Main
{
//假设str1长度短
public static String getMaxSubstr(String str1, String str2)
{
char[] arr1 = str1.toCharArray();
char[] arr2 = str2.toCharArray();
int len1 = arr1.length;
int len2 = arr2.length;
//最长子串的起始位置
int start = 0;
//最长子串的长度
int maxLen = 0;
//多增加一行一列，作为辅助状态
//状态： 以a的第i个字符结尾和以b的第j个字符结尾的最长公共子串的长度
int[][] maxSubLen = new int[len1 + 1][len2 + 1];

for(int i = 1; i <= len1; ++i)
{
for(int j = 1; j <= len2; ++j)
{
//如果第i个字符和第j个字符相等，则进行累加
if(arr1[i - 1] == arr2[j - 1])
{
maxSubLen[i][j] = maxSubLen[i - 1][j - 1] + 1;
//更新
if(maxLen < maxSubLen[i][j])
{
maxLen = maxSubLen[i][j];
start = i - maxLen;
}
}
}
}
return str1.substring(start, start + maxLen);
}
public static void main(String[] args) throws Exception
{
BufferedReader reader = new BufferedReader(new InputStreamReader(System.in));
String str1;
String str2;
while((str1 = reader.readLine()) != null)
{
str2 = reader.readLine();
if(str1.length() < str2.length())
System.out.println(getMaxSubstr(str1, str2));
else
System.out.println(getMaxSubstr(str2, str1));
}
}
}