sharehu的博客

package com.heima.test;    import java.util.HashMap;  import java.util.Map;  import java.util.Scanner;    import javax.swing.plaf.synth.SynthSpinnerUI;    /**  * @author fenuang 统计字符

#include#includevoid makeNext(contant char p[],int next[]){//创建F int m=Strlen(p); int q,k; next [0]=0; for(q=1,k=0;q<m;++q){ while(k>0&&p[q]!=p[k]) k=next[

public class Solution { public int FindGreatestSumOfSubArray(int[] array) { int sum= 0; int max = array[0]; for(int i=0;i<array.length;i++){ if(sum>=0)

package 把数组排成最小的数;import java.util.ArrayList;import java.util.Collections;import java.util.Comparator;public class Solution { public static String PrintMinNumber(int [] numbers) { int n;

/**public class TreeNode { int val = 0; TreeNode left = null; TreeNode right = null; public TreeNode(int val) { this.val = val; }}*/public class Solution { publi