Skip to content

Commit 1463892

Browse files
package line is added
1 parent d3c66ff commit 1463892

File tree

7 files changed

+13
-9
lines changed

7 files changed

+13
-9
lines changed

FunWithCode/Pattern/PascelTriangle.java

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,5 +1,5 @@
1+
package Pattern;
12
import java.util.*;
2-
33
public class PascelTriangle {
44
static int[][] pascelTriangle(int n) {
55
int arr[][] = new int[n - 1][];

FunWithCode/Pattern/pattern1.java

Lines changed: 2 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,4 +1,5 @@
1-
class pattern1
1+
package Pattern;
2+
public class pattern1
23
{
34
public static void main(String[]args)
45
{

FunWithCode/Pattern/pattern2.java

Lines changed: 2 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,4 +1,5 @@
1-
class pattern2
1+
package Pattern;
2+
public class pattern2
23
{
34
public static void main(String[]arg)
45
{

FunWithCode/Pattern/pattern3.java

Lines changed: 2 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,4 +1,5 @@
1-
class pattern3
1+
package Pattern;
2+
public class pattern3
23
{
34
public static void main(String[]args){
45
int n=7;

FunWithCode/Pattern/patternM.java

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,5 +1,5 @@
1+
package Pattern;
12
import java.util.Scanner;
2-
33
public class patternM {
44
public static void main(String arg[]){
55
Scanner sc=new Scanner(System.in);

FunWithCode/Pattern/spiral.java

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,4 +1,4 @@
1-
1+
package Pattern;
22
public class spiral {
33
public static void main(String[] args) {
44
// S-

StringBasedProblems/SubstringEqual.java

Lines changed: 4 additions & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -55,7 +55,7 @@ public static void main(String[] args) {
5555
int count=0;
5656

5757
while( j<c2.length && i<c1.length && c1[k]==c2[j]){
58-
System.out.println(c1[k]);
58+
System.out.print(c1[k]);
5959
k++;
6060
j++;
6161
count++;
@@ -66,15 +66,15 @@ public static void main(String[] args) {
6666
k=i;
6767
j++;
6868
if(count >0)
69-
System.out.println(count);
69+
System.out.print(count);
7070
if(max<count)
7171
max=count;
7272
}
7373
i++;
7474
// System.out.println(count);
7575

7676
}
77-
System.out.println(max);
77+
System.out.print(max);
7878

7979

8080
// int max=0;
@@ -88,6 +88,7 @@ public static void main(String[] args) {
8888
// max=count;
8989
// }
9090
// System.out.println(max);
91+
9192
}
9293
}
9394

0 commit comments

Comments
 (0)