注册一亩三分地论坛,查看更多干货!
您需要 登录 才可以下载或查看附件。没有帐号?注册账号 
x
本帖最后由 hmaccelerate 于 2020-11-15 11:47 编辑
akuna capital 2021 campus data infra dev ..
考了 Divisibility of Strings和Binary AutoComplete
Divisibility: 能通过所以test case
private static int solve(String s1,String s2){
if(s1.length()%s2.length())
return -1;. Χ
int l2=s2.length();
for(int i=0;i<s.length();i++){
if(s1.charAt(i)!=s2.charAt(i%l2))
return -1;
}
if(s2%2==0){
if(!s2.substring(0,s2.length()/2).contentEquals(s2.substring(s2.length()/2, s2.length())))
return s2.length();
}
int divisible = 1;
for(int i=0;i<s2.length()/2;i++){
if(t.length()%divisible++ != 0) {
continue;
}. 1point 3 acres
int j=0;
for(;j<s2.length();j++){
if(s2.charAt(j)!=s2.charAt(j%(i+1)))
break
}-baidu 1point3acres
if(j==s2.length())
reutrn i+1;
}
return s2.length();.1point3acres
}
binary:https://leetcode.com/discuss/int ... binary-autocomplete. ----
求加米,谢谢~.
.--
|