231004 双胞胎z生日直播.zip
(被大眼吞了三条 见下图)(缓慢申诉中)
▪️我命运般的双胞胎zhttps://t.cn/A6ODJHip
▪️hunter喜欢的waterhttps://t.cn/A6ODJHij
▪️roady们的逃学威龙https://t.cn/A6ODim6N
▪️被笨哭了https://t.cn/A6ODim6C
▪️俩笨蛋许愿https://t.cn/A6ODJHiQ
▪️byebye17岁https://t.cn/A6ODJHiW
▪️帕亨特の帅气的珉縡哥 六行诗神作https://t.cn/A6ODJHiR
▪️难道他真的是n行诗天才https://t.cn/A6ODJHi0
▪️Hunter's playlisthttps://t.cn/A6ODJHiH
▪️宿舍出没的海妖有峻https://t.cn/A6ODJHiY
▪️双胞胎z初印象https://t.cn/A6ODJHiO
▪️想尝试的发色https://t.cn/A6ODjGd6
▪️手长超过19.6cm的请联络https://t.cn/A6ODJHiT
▪️要当亲故还是当努娜 我当然allhttps://t.cn/A6ODJHil
(被大眼吞了三条 见下图)(缓慢申诉中)
▪️我命运般的双胞胎zhttps://t.cn/A6ODJHip
▪️hunter喜欢的waterhttps://t.cn/A6ODJHij
▪️roady们的逃学威龙https://t.cn/A6ODim6N
▪️被笨哭了https://t.cn/A6ODim6C
▪️俩笨蛋许愿https://t.cn/A6ODJHiQ
▪️byebye17岁https://t.cn/A6ODJHiW
▪️帕亨特の帅气的珉縡哥 六行诗神作https://t.cn/A6ODJHiR
▪️难道他真的是n行诗天才https://t.cn/A6ODJHi0
▪️Hunter's playlisthttps://t.cn/A6ODJHiH
▪️宿舍出没的海妖有峻https://t.cn/A6ODJHiY
▪️双胞胎z初印象https://t.cn/A6ODJHiO
▪️想尝试的发色https://t.cn/A6ODjGd6
▪️手长超过19.6cm的请联络https://t.cn/A6ODJHiT
▪️要当亲故还是当努娜 我当然allhttps://t.cn/A6ODJHil
好好嗑啊好好嗑啊好好嗑啊!!!!!方小宝阿飞小花怎么演员们这么会的吗!!!!!!!到处都是糖[送花花][送花花][送花花]!!!!!狠狠嗑到了!!!!!!z///s///x还下意识喊c///y喊哥!!阿飞还单手背起李莲花omg!!!!!!!!!!!!!什么猛A本A!!!!!!!!!!!不愧是演唱会当天还要健身的笛大盟主!!!!!!!好嗑好嗑,all花太好嗑了!!!!!!真的好喜欢主角团三人组呀,好期待楼第二部噢,看这三人可可爱爱吵吵闹闹互动日常几百集都不会腻[抱一抱][抱一抱][抱一抱][抱一抱][抱一抱]
【14】Longest Common Prefix 最长共同前缀
Input: ["flower","flow","flight"]
Output: "fl"
Example 2:
Input: ["dog","racecar","car"]
Output: ""
Explanation: There is no common prefix among the input strings.
Note:
All given inputs are in lowercase letters a-z.
public class Solution {
public String longestCommonPrefix(String[] strs) {
if (strs == null || strs.length == 0) return "";
String res = new String();
for (int j = 0; j < strs[0].length(); ++j) {
char c = strs[0].charAt(j);
for (int i = 1; i < strs.length; ++i) {
if (j >= strs[i].length() || strs[i].charAt(j) != c) {
return res;
}
}
res += Character.toString(c);
}
return res;
}
}
Input: ["flower","flow","flight"]
Output: "fl"
Example 2:
Input: ["dog","racecar","car"]
Output: ""
Explanation: There is no common prefix among the input strings.
Note:
All given inputs are in lowercase letters a-z.
public class Solution {
public String longestCommonPrefix(String[] strs) {
if (strs == null || strs.length == 0) return "";
String res = new String();
for (int j = 0; j < strs[0].length(); ++j) {
char c = strs[0].charAt(j);
for (int i = 1; i < strs.length; ++i) {
if (j >= strs[i].length() || strs[i].charAt(j) != c) {
return res;
}
}
res += Character.toString(c);
}
return res;
}
}
✋热门推荐