// 输出1-100内前5个可以被3整除的数 public class Demo { public static void main(String[] args) { int num = 0; for (int i =1; i <= 100; i++) { if (i % 3 == 0) { System.out.println(" " + i); num++; } if (num == 5) { break; } } } } 输出: 3 6 9 12 15 //输出101-20
# 题目 5. Longest Palindromic Substring Given a string S, find the longest palindromic substring in S. You may assume that the maximum length of S is 1000, and there exists one unique longest palindromic substring. # 思路 暴力破解(我和我同学也喜欢叫爆破): 先固定下标,再固定长度,这
# 题目 3. Longest Substring Without Repeating Characters Given a string, find the length of the longest substring without repeating characters. Examples: Given "abcabcbb", the answer is "abc", which the length is 3. Given "bbbbb&quo