子串substring
来源:互联网 发布:电子病历源码 编辑:程序博客网 时间:2024/04/29 11:00
public class SubstringExample {/** * @param args */public static void main(String[] args) {// TODO Auto-generated method stubString str = new String("Javacodegeeks");System.out.println("Initial string is: " + str);System.out.println("Start position=4 and no end position specified: "+ str.substring(4));System.out.println("Start position=2 and end position=11: "+ str.substring(2, 11));// if start = end, then the extracted string will be emptySystem.out.println("Start position=3 and end position=3: "+ str.substring(3, 3).isEmpty());// In the following cases we will get// java.lang.StringIndexOutOfBoundException// if (start < 0 or end < 0)System.out.println("Start position=-2 and end position=5: "+ str.substring(-2, 5));// if (start > end)System.out.println("Start position=5 and end position=2: "+ str.substring(5, 2));}}原文:http://examples.javacodegeeks.com/java-basics/string-java-basics/substring-java-example/
0 0
- 子串substring
- 最长公共子串 Longest common subString
- Longest Palindromic Substring 最长回文子串
- Longest Palindromic Substring-----最长回文子串
- 最长公共子串(Longest-Common-Substring)
- longest palindromic substring(最长回文子串)
- 最长回文子串 Longest Palindromic Substring
- Longest Palindromic Substring 最长回文子串
- 最长回文子串(Longest Palindromic Substring)
- Longest Palindromic Substring 最长回文子串
- 最长回文子串 Longest Palindromic Substring
- Minimum Window Substring 最小窗口子串
- Longest Palindromic Substring 最长回文子串
- NOIP 2015 D2 T2 子串 substring
- 最长公共子串 Longest Common SubString
- Longest Palindromic Substring 最长回文子串
- Minimum Window Substring:最小窗口子串
- Substring子序列
- 键值表
- protobuf-IOS简单总结(编译、环境搭建)
- 调试笔记一
- matlab
- 算法导论--分治法--P17
- 子串substring
- java试题40例
- ASP.NET在IIS7.5(IIS7)配置伪静态
- C语言编程基础考试
- InlineHook是什么?
- 回调函的作用/用途/使用场景
- TreeView树形目录的建立,数据库为Sqlite
- 发送http post请求soap服务
- C++获取系统时间的方式