51CTO博客开发
import java.io.*; public class readString{ private static String st = "Fourscoreandsevenyearsagoourfaathersbroughtforth
import java.io.*; public class reverseString { public static String reverseString(String str){ String result= &quo
import java.io.*; public class longestCommonSubstring { private static String longestCommonSubstring(String S1, String S2) { int Start = 0; int Max = 0;  
import java.lang.Math.*; import java.io.*; public class SumPriFib { public static long SumPF(long MinP) { long SumP=0; for(long i=2;i<(long)Math.sqrt(MinP)+1;i++) { if(MinP%i==0) {
public class PrimeFibonacci { public static long PrimeFib(int Minp) { long pf = 0; for(int i =1; i<100;i++) { pf=Fibonacci.fib(i); if((pf>Minp)) { if(Prime.primeNumber(pf)) { &
public class Fibonacci { public static int fib(int n) { int f1 = 1, f2 = 1; &n
import java.lang.Math.*; import java.io.*; public class Prime { public static Boolean primeNumber(long x) { Boolean flag = true; if(x<4) { if(x==1) flag=false; } else {
struct Rect { Rect(int x1, int x2, int y1, int y2) : x1(x1), x2(x2), y1(y1), y2(y2) { assert(x1 < x2); &nbs
import java.util.*; import java.lang.String; public class FindMaxConsecutive { public static char findMaxConsecutive(char[] arg) { char former = '0'; int max = 0; int tempmax=0;
import java.*; import java.util.Hashtable; import java.lang.String; public class FindDuplicate { public static void main(String args[]) { String[] arg=null; arg=args[0].split(&qu
class Node { public int item; public Node left; &nb
sameMirroredTree.java
import java.lang.*; public class IPtoNum { public static double IPAddressToNumber(String IPaddress1) { int i; String [] arrDec=null; double num = 0; if (IPaddress1 == "") { return
Copyright © 2005-2024 51CTO.COM 版权所有 京ICP证060544号