代码搜索：SubString
找到约 5,777 项符合「SubString」的源代码
代码结果 5,777
www.eeworm.com/read/452050/7451391
java 3091284_ac_296ms_2516k.java
import java.util.*;
public class Main
{
public static void main(String[] args)
{
Scanner cin = new Scanner(System.in);
String exp, l, r;
int t, p;
www.eeworm.com/read/452050/7451521
java 3472518_re.java
import java.util.*;
public class Main {
private Scanner in;
private int n, m;
private int [][] LCA = new int [901][901];
private int [][] tree = new int [901][];
private final boolean W
www.eeworm.com/read/452050/7451820
java 3663939_ac_172ms_2724k.java
import java.util.*;
public class Main {
private Scanner in;
public static void main(String[] args) {
new Main().run();
}
private double calc(String smeech) {
if (smeech.indexOf('(
www.eeworm.com/read/451891/7454700
java 金额转换.java
//说明：如果输入一个不带小数点的整数，则输出***元整；输入小数则换成角分
///但此程序有限制如果输入带小数点的金额，必须是两位以上小数，
///并且金额不能超过一万亿，有兴趣可以自己改进
class ReadString
{
String str;//传入的字符串
String decimalFraction;//小数部分
String integerStr;//整数部分
www.eeworm.com/read/450160/7489776
js s_code.js
var s_account="mathmain"
var s=s_gi(s_account)
s.dynamicAccountSelection=true
s.dynamicAccountList="mathdev=www-external-dev.,www-external-test.,www-external-stage.,www-external-dev2.,www-external-
www.eeworm.com/read/449385/7506237
js urchin.js
//-- Google Analytics Urchin Module
//-- Copyright 2005 Google, All Rights Reserved.
//-- Urchin On Demand Settings ONLY
var _uacct=""; // set up the Urchin Account
var _userv=1; // service mode
www.eeworm.com/read/449352/7508495
js urchin.js
//-- Google Analytics Urchin Module
//-- Copyright 2007 Google, All Rights Reserved.
//-- Urchin On Demand Settings ONLY
var _uacct=""; // set up the Urchin Account
var _userv=1; // service mode
www.eeworm.com/read/449352/7508506
js urchin.js
//-- Google Analytics Urchin Module
//-- Copyright 2007 Google, All Rights Reserved.
//-- Urchin On Demand Settings ONLY
var _uacct=""; // set up the Urchin Account
var _userv=1; // service mode
www.eeworm.com/read/448997/7520435
cpp algo0401.cpp
#include "algo0403.cpp"
int Index(SString S, SString T, int pos) { // 算法4.1
// T为非空串。若主串S中第pos个字符之后存在与T相等的子串，
// 则返回第一个这样的子串在S中的位置，否则返回0
int n,m,i;
SString sub;
if (pos > 0) {
www.eeworm.com/read/448286/7535404
js urchin.js
//-- Google Analytics Urchin Module
//-- Copyright 2007 Google, All Rights Reserved.
//-- Urchin On Demand Settings ONLY
var _uacct=""; // set up the Urchin Account
var _userv=1; // service mode