/** * @Description 返回字符串中目标字符串的位置 * @param str * @return */ public static Integer strStr(String str, String target) { int length = str.length(); int targetLength = target.length(); if (

/** * 两个已顺序排序数组的合并 * * @param aList * @param bList * @return */ public static List mergeTwoSortList(List aList, List bList) { int aLength = aList.size(), bLength = bList.size(); L

package utils;import java.util.HashMap;import java.util.HashSet;import java.util.LinkedList;import java.util.Queue;import com.google.gson.Gson;public class WordLadder { // solution function

public class Test { public static void main(String[] args) throws IOException { String[] tokens = new String[] { "2", "1", "+", "3", "*" }; System.out.println(evalRPN(tokens)); } public sta

public static boolean checkChinese(String sequence) {   final String format = "[\\u4E00-\\u9FA5\\uF900-\\uFA2D]";   boolean result = false;   Pattern pattern = Pattern.com

/** * @Description 返回目标数字在有序数组中的位置(假设有序数组中不存在重复数字) * @param source * @param target * @return */ public static Integer numIndex(int[] source, int target) { int index = 0; if (source ==

给定一个m*n矩阵，返回所有元素在矩阵中的螺旋序列，例如：