原创 Fibonacci
public class Fibonacci { public static int fib(int n) { int f1 = 1, f2 = 1; int m = 0
2019-02-22 14:55:22
原创 Prime
import java.lang.Math.*; import java.io.*; public class Prime { public static Boolean primeNumber(long x) { Boolean f
2019-02-22 14:55:22
原创 Edge
struct Rect { Rect(int x1, int x2, int y1, int y2) : x1(x1), x2(x2), y1(y1), y2(y2) { assert(x1 < x2
2019-02-22 14:55:21
原创 PrimeFibonacci
public class PrimeFibonacci { public static long PrimeFib(int Minp) { long pf = 0; for(int i =1; i<100;i++) { pf=Fibona
2018-09-13 03:18:09
原创 longestCommonSubstring
import java.io.*; public class longestCommonSubstring { private static String longestCommonSubstring(String S1, String S
2018-09-13 03:18:08
原创 Write a function to convert an IPv4 Address in string format to an unsigned integer
import java.lang.*; public class IPtoNum { public static double IPAddressToNumber(String IPaddress1) { int i; String []
2018-09-13 03:18:07
原创 sameMirroredTree.java
import java.*; public class sameMirroredTree { public static Boolean isSymmetric(Node root1, Node root2 ) { if( (root1
2018-09-13 03:18:07
3
原创 Fibonacci
public class Fibonacci { public static int fib(int n) { int f1 = 1, f2 = 1; int m = 0
2018-09-13 03:18:06
原创 FindDuplicate
import java.*; import java.util.Hashtable; import java.lang.String; public class FindDuplicate { public static void m
2018-09-13 03:18:06
1
原创 Edge
struct Rect { Rect(int x1, int x2, int y1, int y2) : x1(x1), x2(x2), y1(y1), y2(y2) { assert(x1 < x2
2018-09-13 03:18:05
原创 SumPF
import java.lang.Math.*; import java.io.*; public class SumPriFib { public static long SumPF(long MinP) { long SumP=0;
2018-09-13 03:18:05
2
原创 readString
import java.io.*; public class readString{ private static String st = "Fourscoreandsevenyearsagoourfaathersbroughtf
2018-09-13 03:18:05
原创 FindMaxConsecutive.java
import java.util.*; import java.lang.String; public class FindMaxConsecutive { public static char findMaxConsecutive(
2018-09-13 03:18:05
2