热门标签 | HotTags
当前位置:  开发笔记 > 编程语言 > 正文

Java实现的文本字符串操作工具类实例【数据替换,加密解密操作】

这篇文章主要介绍了Java实现的文本字符串操作工具类,可实现数据替换、加密解密等操作,涉及java字符串遍历、编码转换、替换等相关操作技巧,需要的朋友可以参考下

本文实例讲述了Java实现的文本字符串操作工具类。分享给大家供大家参考,具体如下:

package com.gcloud.common;
import org.apache.commons.lang.StringUtils;
import java.security.MessageDigest;
import java.security.NoSuchAlgorithmException;
import java.text.BreakIterator;
import java.util.ArrayList;
import java.util.Date;
import java.util.Random;
/**
 * 文本字符串工具类
 * Created by charlin on 2017/9/10.
 */
public class TextUtil {
  private static final char[] QUOTE_ENCODE = """.toCharArray();
  private static final char[] AMP_ENCODE = "&".toCharArray();
  private static final char[] LT_ENCODE = "<".toCharArray();
  private static final char[] GT_ENCODE = ">".toCharArray();
  private final static String[] hex = { "00", "01", "02", "03", "04", "05",
      "06", "07", "08", "09", "0A", "0B", "0C", "0D", "0E", "0F", "10",
      "11", "12", "13", "14", "15", "16", "17", "18", "19", "1A", "1B",
      "1C", "1D", "1E", "1F", "20", "21", "22", "23", "24", "25", "26",
      "27", "28", "29", "2A", "2B", "2C", "2D", "2E", "2F", "30", "31",
      "32", "33", "34", "35", "36", "37", "38", "39", "3A", "3B", "3C",
      "3D", "3E", "3F", "40", "41", "42", "43", "44", "45", "46", "47",
      "48", "49", "4A", "4B", "4C", "4D", "4E", "4F", "50", "51", "52",
      "53", "54", "55", "56", "57", "58", "59", "5A", "5B", "5C", "5D",
      "5E", "5F", "60", "61", "62", "63", "64", "65", "66", "67", "68",
      "69", "6A", "6B", "6C", "6D", "6E", "6F", "70", "71", "72", "73",
      "74", "75", "76", "77", "78", "79", "7A", "7B", "7C", "7D", "7E",
      "7F", "80", "81", "82", "83", "84", "85", "86", "87", "88", "89",
      "8A", "8B", "8C", "8D", "8E", "8F", "90", "91", "92", "93", "94",
      "95", "96", "97", "98", "99", "9A", "9B", "9C", "9D", "9E", "9F",
      "A0", "A1", "A2", "A3", "A4", "A5", "A6", "A7", "A8", "A9", "AA",
      "AB", "AC", "AD", "AE", "AF", "B0", "B1", "B2", "B3", "B4", "B5",
      "B6", "B7", "B8", "B9", "BA", "BB", "BC", "BD", "BE", "BF", "C0",
      "C1", "C2", "C3", "C4", "C5", "C6", "C7", "C8", "C9", "CA", "CB",
      "CC", "CD", "CE", "CF", "D0", "D1", "D2", "D3", "D4", "D5", "D6",
      "D7", "D8", "D9", "DA", "DB", "DC", "DD", "DE", "DF", "E0", "E1",
      "E2", "E3", "E4", "E5", "E6", "E7", "E8", "E9", "EA", "EB", "EC",
      "ED", "EE", "EF", "F0", "F1", "F2", "F3", "F4", "F5", "F6", "F7",
      "F8", "F9", "FA", "FB", "FC", "FD", "FE", "FF" };
  private final static byte[] val = { 0x3F, 0x3F, 0x3F, 0x3F, 0x3F, 0x3F,
      0x3F, 0x3F, 0x3F, 0x3F, 0x3F, 0x3F, 0x3F, 0x3F, 0x3F, 0x3F, 0x3F,
      0x3F, 0x3F, 0x3F, 0x3F, 0x3F, 0x3F, 0x3F, 0x3F, 0x3F, 0x3F, 0x3F,
      0x3F, 0x3F, 0x3F, 0x3F, 0x3F, 0x3F, 0x3F, 0x3F, 0x3F, 0x3F, 0x3F,
      0x3F, 0x3F, 0x3F, 0x3F, 0x3F, 0x3F, 0x3F, 0x3F, 0x3F, 0x00, 0x01,
      0x02, 0x03, 0x04, 0x05, 0x06, 0x07, 0x08, 0x09, 0x3F, 0x3F, 0x3F,
      0x3F, 0x3F, 0x3F, 0x3F, 0x0A, 0x0B, 0x0C, 0x0D, 0x0E, 0x0F, 0x3F,
      0x3F, 0x3F, 0x3F, 0x3F, 0x3F, 0x3F, 0x3F, 0x3F, 0x3F, 0x3F, 0x3F,
      0x3F, 0x3F, 0x3F, 0x3F, 0x3F, 0x3F, 0x3F, 0x3F, 0x3F, 0x3F, 0x3F,
      0x3F, 0x3F, 0x3F, 0x0A, 0x0B, 0x0C, 0x0D, 0x0E, 0x0F, 0x3F, 0x3F,
      0x3F, 0x3F, 0x3F, 0x3F, 0x3F, 0x3F, 0x3F, 0x3F, 0x3F, 0x3F, 0x3F,
      0x3F, 0x3F, 0x3F, 0x3F, 0x3F, 0x3F, 0x3F, 0x3F, 0x3F, 0x3F, 0x3F,
      0x3F, 0x3F, 0x3F, 0x3F, 0x3F, 0x3F, 0x3F, 0x3F, 0x3F, 0x3F, 0x3F,
      0x3F, 0x3F, 0x3F, 0x3F, 0x3F, 0x3F, 0x3F, 0x3F, 0x3F, 0x3F, 0x3F,
      0x3F, 0x3F, 0x3F, 0x3F, 0x3F, 0x3F, 0x3F, 0x3F, 0x3F, 0x3F, 0x3F,
      0x3F, 0x3F, 0x3F, 0x3F, 0x3F, 0x3F, 0x3F, 0x3F, 0x3F, 0x3F, 0x3F,
      0x3F, 0x3F, 0x3F, 0x3F, 0x3F, 0x3F, 0x3F, 0x3F, 0x3F, 0x3F, 0x3F,
      0x3F, 0x3F, 0x3F, 0x3F, 0x3F, 0x3F, 0x3F, 0x3F, 0x3F, 0x3F, 0x3F,
      0x3F, 0x3F, 0x3F, 0x3F, 0x3F, 0x3F, 0x3F, 0x3F, 0x3F, 0x3F, 0x3F,
      0x3F, 0x3F, 0x3F, 0x3F, 0x3F, 0x3F, 0x3F, 0x3F, 0x3F, 0x3F, 0x3F,
      0x3F, 0x3F, 0x3F, 0x3F, 0x3F, 0x3F, 0x3F, 0x3F, 0x3F, 0x3F, 0x3F,
      0x3F, 0x3F, 0x3F, 0x3F, 0x3F, 0x3F, 0x3F, 0x3F, 0x3F, 0x3F, 0x3F,
      0x3F, 0x3F, 0x3F, 0x3F, 0x3F, 0x3F, 0x3F, 0x3F, 0x3F, 0x3F, 0x3F,
      0x3F, 0x3F, 0x3F, 0x3F, 0x3F, 0x3F, 0x3F, 0x3F };
  private static MessageDigest digest = null;
  /**
   * 替换字符串
   * @param line
   * @param oldStr
   * @param newStr
   * @return
   */
  public static String replace(String line , String oldStr, String newStr){
    if (StringUtils.isEmpty(line)) return null;
    int index = 0;
    if ((index = line.indexOf(oldStr, index)) >= 0){
      char[] charArray = line.toCharArray();
      char[] newStrArray = newStr.toCharArray();
      int oldLen = oldStr.length();
      StringBuffer buf = new StringBuffer(charArray.length);
      buf.append(charArray, 0, index).append(newStrArray);
      index += oldLen;
      int i = index;
      while((index = line.indexOf(oldStr, index)) > 0){
        buf.append(charArray, i, index - i).append(newStrArray);
        index += oldLen;
        i = index;
      }
      buf.append(charArray, i, charArray.length - i);
      return buf.toString();
    }
    return line;
  }
  /**
   * 替换字符串,并存入替换次数
   * @param line
   * @param oldStr
   * @param newStr
   * @return
   */
  public static String replace(String line , String oldStr, String newStr, int[] countArr){
    if (StringUtils.isEmpty(line)) return null;
    int index = 0;
    if ((index = line.indexOf(oldStr, index)) >= 0){
      int count = 0;
      count++;
      char[] charArray = line.toCharArray();
      char[] newStrArray = newStr.toCharArray();
      int oldLen = oldStr.length();
      StringBuffer buf = new StringBuffer(charArray.length);
      buf.append(charArray, 0, index).append(newStrArray);
      index += oldLen;
      int i = index;
      while((index = line.indexOf(oldStr, index)) > 0){
        buf.append(charArray, i, index - i).append(newStrArray);
        index += oldLen;
        i = index;
        count++;
      }
      buf.append(charArray, i, charArray.length - i);
      countArr[0] = count;
      return buf.toString();
    }
    return line;
  }
  /**
   * 替换字符串,不区分大小写
   * @param line
   * @param oldStr
   * @param newStr
   * @return
   */
  public static String replaceIgnoreCase(String line , String oldStr, String newStr){
    if (StringUtils.isEmpty(line)) return null;
    int index = 0;
    line = line.toLowerCase();
    oldStr = oldStr.toLowerCase();
    if ((index = line.indexOf(oldStr, index)) >= 0){
      char[] charArray = line.toCharArray();
      char[] newStrArray = newStr.toCharArray();
      int oldLen = oldStr.length();
      StringBuffer buf = new StringBuffer(charArray.length);
      buf.append(charArray, 0, index).append(newStrArray);
      index += oldLen;
      int i = index;
      while((index = line.indexOf(oldStr, index)) > 0){
        buf.append(charArray, i, index - i).append(newStrArray);
        index += oldLen;
        i = index;
      }
      buf.append(charArray, i, charArray.length - i);
      return buf.toString();
    }
    return line;
  }
  /**
   * 替换字符串,不区分大小写, 并存入替换次数
   * @param line
   * @param oldStr
   * @param newStr
   * @return
   */
  public static String replaceIgnoreCase(String line , String oldStr, String newStr, int[] countArr){
    if (StringUtils.isEmpty(line)) return null;
    int index = 0;
    line = line.toLowerCase();
    oldStr = oldStr.toLowerCase();
    if ((index = line.indexOf(oldStr, index)) >= 0){
      char[] charArray = line.toCharArray();
      char[] newStrArray = newStr.toCharArray();
      int oldLen = oldStr.length();
      StringBuffer buf = new StringBuffer(charArray.length);
      buf.append(charArray, 0, index).append(newStrArray);
      index += oldLen;
      int i = index;
      int count = 0;
      while((index = line.indexOf(oldStr, index)) > 0){
        count ++;
        buf.append(charArray, i, index - i).append(newStrArray);
        index += oldLen;
        i = index;
      }
      buf.append(charArray, i, charArray.length - i);
      countArr[0] = count;
      return buf.toString();
    }
    return line;
  }
  /**
   * 替换页面html标签
   * @param htmlStr
   * @return
   */
  public static String escapeHTMLTags(String htmlStr) {
    if (StringUtils.isEmpty(htmlStr)) return null;
    char ch;
    int last = 0;
    char[] htmlStrArr = htmlStr.toCharArray();
    int len = htmlStrArr.length;
    StringBuffer outBuf = new StringBuffer((int) (len * 1.3));
    int i = 0;
    for (; i  '>') {
        continue;
      } else if (ch == '<') {
        if (i > last) {
          outBuf.append(htmlStrArr, last, i - last);
        }
        last = i + 1;
        outBuf.append(LT_ENCODE);
      } else if (ch == '>') {
        if (i > last) {
          outBuf.append(htmlStrArr, last, i - last);
        }
        last = i + 1;
        outBuf.append(GT_ENCODE);
      }
    }
    if (last == 0) {
      return htmlStr;
    }
    if (i > last) {
      outBuf.append(htmlStrArr, last, i - last);
    }
    return outBuf.toString();
  }
  /**
   * Hashes a String using the Md5 algorithm and returns the result as a
   * String of hexadecimal numbers. This method is synchronized to avoid
   * excessive MessageDigest object creation. If calling this method becomes a
   * bottleneck in your code, you may wish to maintain a pool of MessageDigest
   * objects instead of using this method.
   * @param data
   * @return
   */
  public synchronized static String hash(String data) {
    if (digest == null) {
      try {
        digest = MessageDigest.getInstance("MD5");
      } catch (NoSuchAlgorithmException e) {
        System.err.println("Failed to load the MD5 MessageDigest.Jive will be unable to function normally.");
        e.printStackTrace();
      }
    }
    digest.update(data.getBytes());
    return encodeHex(digest.digest());
  }
  /**
   * Turns an array of bytes into a String representing each byte as an
   * unsigned hex number.
   * @param bytes
   * @return
   */
  public static final String encodeHex(byte[] bytes) {
    StringBuffer buf = new StringBuffer(bytes.length * 2);
    int i;
    for (i = 0; i > 2) & 0x3f;
      ret.append(cvt.charAt(c));
      c = (data[i] <<4) & 0x3f;
      if (++i > 4) & 0x0f;
      ret.append(cvt.charAt(c));
      if (i > 6) & 0x03;
        ret.append(cvt.charAt(c));
      } else {
        ++i;
        ret.append((char) fillchar);
      }
      if (i > 4) & 0x3));
      ret.append((char) c);
      if (++i > 2) & 0xf);
        ret.append((char) c1);
      }
      if (++i  0) {
        wordList.add(tmp);
      }
    }
    return (String[]) wordList.toArray(new String[wordList.size()]);
  }
  /**
   * Pseudo-random number generator object for use with randomString(). The
   * Random class is not considered to be cryptographically secure, so only
   * use these random Strings for low to medium security applications.
   */
  private static Random randGen = new Random();
  /**
   * Array of numbers and letters of mixed case. Numbers appear in the list
   * twice so that there is a more equal chance that a number will be picked.
   * We can use the array to get a random number or letter by picking a random
   * array index.
   */
  private static char[] numbersAndLetters = ("0123456789abcdefghijklmnopqrstuvwxyz" + "0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ").toCharArray();
  /**
   * Returns a random String of numbers and letters (lower and upper case) of
   * the specified length. The method uses the Random class that is built-in
   * to Java which is suitable for low to medium grade security uses. This
   * means that the output is only pseudo random, i.e., each number is
   * mathematically generated so is not truly random.
   * @param length the desired length of the random String to return.
   * @return a random String of numbers and letters of the specified length.
   */
  public static final String randomString(int length) {
    if (length <1) {
      return null;
    }
    char[] randBuffer = new char[length];
    for (int i = 0; i length, the String will be
   * chopped there. If no newline or whitespace is found in
   * string up to the index length, the String
   * will chopped at length.
   * 

* For example, chopAtWord("This is a nice String", 10) will return "This is * a" which is the first word boundary less than or equal to 10 characters * into the original String. * @param string the String to chop. * @param length * @return a substring of string whose length is less than or * equal to length, and that is chopped at * whitespace. */ public static final String chopAtWord(String string, int length) { if (string == null) { return string; } char[] charArray = string.toCharArray(); int sLength = string.length(); if (length 0; i--) { if (charArray[i] == ' ') { return string.substring(0, i).trim(); } } // Did not find word boundary so return original String chopped at // specified length. return string.substring(0, length); } /** * Escapes all necessary characters in the String so that it can be used in * an XML doc. * @param string the string to escape. * @return the string with appropriate characters escaped. */ public static final String escapeForXML(String string) { if (string == null) { return null; } char ch; int i = 0; int last = 0; char[] input = string.toCharArray(); int len = input.length; StringBuffer out = new StringBuffer((int) (len * 1.3)); for (; i '>') { continue; } else if (ch == '<') { if (i > last) { out.append(input, last, i - last); } last = i + 1; out.append(LT_ENCODE); } else if (ch == '&') { if (i > last) { out.append(input, last, i - last); } last = i + 1; out.append(AMP_ENCODE); } else if (ch == '"') { if (i > last) { out.append(input, last, i - last); } last = i + 1; out.append(QUOTE_ENCODE); } } if (last == 0) { return string; } if (i > last) { out.append(input, last, i - last); } return out.toString(); } /** * Unescapes the String by converting XML escape sequences back into normal * characters. * @param string the string to unescape. * @return the string with appropriate characters unescaped. */ public static final String unescapeFromXML(String string) { string = replace(string, "<", "<"); string = replace(string, ">", ">"); string = replace(string, """, "\""); return replace(string, "&", "&"); } public static String escape(String s) { StringBuffer sbuf = new StringBuffer(); int len = s.length(); for (int i = 0; i >> 8)]); sbuf.append(hex[(0x00FF & ch)]); } } return sbuf.toString(); } public static String unescape(String s) { StringBuffer sbuf = new StringBuffer(); int i = 0; int len = s.length(); while (i length of 16. * * @param string * the original String to pad. * @param length * the desired length of the new padded String. * @return a new String padded with the required number of 0's. */ public static final String zeroPadString(String string, int length) { if (string == null || string.length() > length) { return string; } StringBuffer buf = new StringBuffer(length); buf.append(zeroArray, 0, length - string.length()).append(string); return buf.toString(); } /** * Formats a Date as a fifteen character long String made up of the Date's * padded millisecond value. * @return a Date encoded as a String. */ public static final String dateToMillis(Date date) { return zeroPadString(Long.toString(date.getTime()), 15); } public static void main(String[] args) { System.out.println(replace("aaaaabbbcccc", "aa", "gg")); System.out.println(replaceIgnoreCase("AAAAbbbcccc", "aa", "gg")); System.out.println(escapeHTMLTags("AAAAbb")); } }

更多关于java算法相关内容感兴趣的读者可查看本站专题:《Java字符与字符串操作技巧总结》、《Java数据结构与算法教程》、《Java操作DOM节点技巧总结》、《Java文件与目录操作技巧汇总》和《Java缓存操作技巧汇总》

希望本文所述对大家java程序设计有所帮助。


推荐阅读
  • 本文讨论了Alink回归预测的不完善问题,指出目前主要针对Python做案例,对其他语言支持不足。同时介绍了pom.xml文件的基本结构和使用方法,以及Maven的相关知识。最后,对Alink回归预测的未来发展提出了期待。 ... [详细]
  • 一、Hadoop来历Hadoop的思想来源于Google在做搜索引擎的时候出现一个很大的问题就是这么多网页我如何才能以最快的速度来搜索到,由于这个问题Google发明 ... [详细]
  • CSS3选择器的使用方法详解,提高Web开发效率和精准度
    本文详细介绍了CSS3新增的选择器方法,包括属性选择器的使用。通过CSS3选择器,可以提高Web开发的效率和精准度,使得查找元素更加方便和快捷。同时,本文还对属性选择器的各种用法进行了详细解释,并给出了相应的代码示例。通过学习本文,读者可以更好地掌握CSS3选择器的使用方法,提升自己的Web开发能力。 ... [详细]
  • 本文介绍了在Win10上安装WinPythonHadoop的详细步骤,包括安装Python环境、安装JDK8、安装pyspark、安装Hadoop和Spark、设置环境变量、下载winutils.exe等。同时提醒注意Hadoop版本与pyspark版本的一致性,并建议重启电脑以确保安装成功。 ... [详细]
  • 在说Hibernate映射前,我们先来了解下对象关系映射ORM。ORM的实现思想就是将关系数据库中表的数据映射成对象,以对象的形式展现。这样开发人员就可以把对数据库的操作转化为对 ... [详细]
  • 本文介绍了在SpringBoot中集成thymeleaf前端模版的配置步骤,包括在application.properties配置文件中添加thymeleaf的配置信息,引入thymeleaf的jar包,以及创建PageController并添加index方法。 ... [详细]
  • 知识图谱——机器大脑中的知识库
    本文介绍了知识图谱在机器大脑中的应用,以及搜索引擎在知识图谱方面的发展。以谷歌知识图谱为例,说明了知识图谱的智能化特点。通过搜索引擎用户可以获取更加智能化的答案,如搜索关键词"Marie Curie",会得到居里夫人的详细信息以及与之相关的历史人物。知识图谱的出现引起了搜索引擎行业的变革,不仅美国的微软必应,中国的百度、搜狗等搜索引擎公司也纷纷推出了自己的知识图谱。 ... [详细]
  • 《数据结构》学习笔记3——串匹配算法性能评估
    本文主要讨论串匹配算法的性能评估,包括模式匹配、字符种类数量、算法复杂度等内容。通过借助C++中的头文件和库,可以实现对串的匹配操作。其中蛮力算法的复杂度为O(m*n),通过随机取出长度为m的子串作为模式P,在文本T中进行匹配,统计平均复杂度。对于成功和失败的匹配分别进行测试,分析其平均复杂度。详情请参考相关学习资源。 ... [详细]
  • 动态规划算法的基本步骤及最长递增子序列问题详解
    本文详细介绍了动态规划算法的基本步骤,包括划分阶段、选择状态、决策和状态转移方程,并以最长递增子序列问题为例进行了详细解析。动态规划算法的有效性依赖于问题本身所具有的最优子结构性质和子问题重叠性质。通过将子问题的解保存在一个表中,在以后尽可能多地利用这些子问题的解,从而提高算法的效率。 ... [详细]
  • Java验证码——kaptcha的使用配置及样式
    本文介绍了如何使用kaptcha库来实现Java验证码的配置和样式设置,包括pom.xml的依赖配置和web.xml中servlet的配置。 ... [详细]
  • Android系统移植与调试之如何修改Android设备状态条上音量加减键在横竖屏切换的时候的显示于隐藏
    本文介绍了如何修改Android设备状态条上音量加减键在横竖屏切换时的显示与隐藏。通过修改系统文件system_bar.xml实现了该功能,并分享了解决思路和经验。 ... [详细]
  • GetWindowLong函数
    今天在看一个代码里头写了GetWindowLong(hwnd,0),我当时就有点费解,靠,上网搜索函数原型说明,死活找不到第 ... [详细]
  • VScode格式化文档换行或不换行的设置方法
    本文介绍了在VScode中设置格式化文档换行或不换行的方法,包括使用插件和修改settings.json文件的内容。详细步骤为:找到settings.json文件,将其中的代码替换为指定的代码。 ... [详细]
  • 基于layUI的图片上传前预览功能的2种实现方式
    本文介绍了基于layUI的图片上传前预览功能的两种实现方式:一种是使用blob+FileReader,另一种是使用layUI自带的参数。通过选择文件后点击文件名,在页面中间弹窗内预览图片。其中,layUI自带的参数实现了图片预览功能。该功能依赖于layUI的上传模块,并使用了blob和FileReader来读取本地文件并获取图像的base64编码。点击文件名时会执行See()函数。摘要长度为169字。 ... [详细]
  • 解决Cydia数据库错误:could not open file /var/lib/dpkg/status 的方法
    本文介绍了解决iOS系统中Cydia数据库错误的方法。通过使用苹果电脑上的Impactor工具和NewTerm软件,以及ifunbox工具和终端命令,可以解决该问题。具体步骤包括下载所需工具、连接手机到电脑、安装NewTerm、下载ifunbox并注册Dropbox账号、下载并解压lib.zip文件、将lib文件夹拖入Books文件夹中,并将lib文件夹拷贝到/var/目录下。以上方法适用于已经越狱且出现Cydia数据库错误的iPhone手机。 ... [详细]
author-avatar
青岛新侨妙妙
这个家伙很懒,什么也没留下!
PHP1.CN | 中国最专业的PHP中文社区 | DevBox开发工具箱 | json解析格式化 |PHP资讯 | PHP教程 | 数据库技术 | 服务器技术 | 前端开发技术 | PHP框架 | 开发工具 | 在线工具
Copyright © 1998 - 2020 PHP1.CN. All Rights Reserved | 京公网安备 11010802041100号 | 京ICP备19059560号-4 | PHP1.CN 第一PHP社区 版权所有