Skip to content

Commit 83b67e5

Browse files
authored
Merge pull request #63 from Suxxxxhyun/Suxxxxhyun
[Solved] PRG_크기가 작은 부분 문자열
2 parents 135bda2 + e1f70bb commit 83b67e5

File tree

4 files changed

+46
-4
lines changed

4 files changed

+46
-4
lines changed
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,21 @@
1+
package Week2.공통.크기가_작은_부분문자열;
2+
3+
public class suhyun {
4+
public static int solution(String t, String p) {
5+
int answer = 0;
6+
for(int i=0; i<t.length() - p.length() + 1; i++){
7+
String s = "";
8+
s = t.substring(i, i+p.length());
9+
if(Long.parseLong(s) <= Long.parseLong(p)){
10+
answer += 1;
11+
}
12+
}
13+
return answer;
14+
}
15+
16+
public static void main(String[] args){
17+
String t = "3141592";
18+
String p = "271";
19+
System.out.println(solution(t, p));
20+
}
21+
}
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,13 @@
1+
def solution(t, p):
2+
answer = 0
3+
for idx in range(0, len(t) - len(p) + 1):
4+
s = ""
5+
for i in range(idx, idx + len(p)):
6+
s += t[i]
7+
if int(s) <= int(p):
8+
answer += 1
9+
return answer
10+
11+
t = "3141592"
12+
p = "271"
13+
print(solution(t, p))
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,12 @@
1+
def solution(t, p):
2+
answer = 0
3+
for idx in range(0, len(t) - len(p) + 1):
4+
s = ""
5+
s = t[idx:idx+len(p)]
6+
if int(s) <= int(p):
7+
answer += 1
8+
return answer
9+
10+
t = "3141592"
11+
p = "271"
12+
print(solution(t, p))

Week2/공통/크기가_작은_부분문자열/test.java

-4
This file was deleted.

0 commit comments

Comments
 (0)