当前位置:网站首页>Related programming problems of string
Related programming problems of string
2022-07-07 01:45:00 【Hu Yangyang y】
Number of string occurrences
character string A, Another string B, Calculation B The string is in A Several times in the string
Example : dsabdnabdsnabeabiwpabekabd **ab**
- Implementation process
- Index the string to find indexOf
- Index record of the found string , Intercept the string
- Until you find the unknown , indexOf The method is -1
- Once you find , Counter ++
/**
* @param str Original string
* @param sub String to find
* @return Number of occurrences
*/
public static int stringCount(String str ,String sub){
// Defining variables , Counter
int count = 0;
// Defining variables , Record the index after string search
int index = 0;
// For the position where the string appears , The query
// Search over and over again , Using a loop while
// The cyclic condition is indexOf Method returns -1
while ( (index=str.indexOf(sub)) != -1 ) {
// Cycle executed index !=-1 The string appears
count ++;
// Intercepting string , Start index index+ The length of the searched string
str = str.substring(index + sub.length());
}
return count;
}Which character appears most
requirement : The specified string can be ( A lowercase letter ) Letter abeegewff , Calculate which character appears the most
The letters in the qualified string can only have 26 individual
> Find out how many times each character appears , Find the maximum
- Implementation process :
- String to array ( Single character operation )
- Create a length of 26 Array of , The counter uses
- Take out the characters in the array , ( character -97) The index of the corresponding array , Counter ++
- Find the maximum value in the array
/**
* Look up the string , Which character appears the most
* @param str To find a string
* @return Returns the character with the most occurrences
*/
public static char charCount(String str){
// String to array
char[] chars = str.toCharArray();
// Definition 26 An array of lengths , Save the number of occurrences of each character
int[] count = new int[26];
// Traversal array
for (int i = 0 ; i < chars.length; i++){
// Take out a single character
char ch = chars[i];
// character - 97 Use as an index of an array ( Array , Counter array )
count[ ch - 97 ] ++;
}
//System.out.println("Arrays.toString(count) = " + Arrays.toString(count));
// Take out count Array , Index of maximum value
int index = 0 ; // Array maximum index
int max = count[0];
for(int i = 1 ; i < count.length ; i++){
if (max < count[i]){
index = i;
max = count[i];
}
}
//index Indexes , Exactly different from the character 97
return (char) (index+97);
}
边栏推荐
- Using the entry level of DVA in taro3.*
- Drag to change order
- 拖拽改变顺序
- 今日问题-2022/7/4 lambda体中修改String引用类型变量
- POJ 3177 Redundant Paths POJ 3352 Road Construction(双连接)
- Baidu flying general BMN timing action positioning framework | data preparation and training guide (Part 1)
- 736. LISP syntax parsing: DFS simulation questions
- 场景实践:基于函数计算快速搭建Wordpress博客系统
- Match VIM from zero (0) -- Introduction to vimscript
- shell脚本快速统计项目代码行数
猜你喜欢

454 Baidu Mianjing 1
![JS reverse -- ob confusion and accelerated music that poked the [hornet's nest]](/img/40/da56fe6468da64dd37d6b5b0082206.png)
JS reverse -- ob confusion and accelerated music that poked the [hornet's nest]

Clickhouse fields are grouped and aggregated, and SQL is queried according to the granularity of any time period

修改px4飞控的系统时间

454-百度面经1

LeetCode:1175. 质数排列

Transplant DAC chip mcp4725 to nuc980

黑马笔记---异常处理

新工作感悟~辞旧迎新~

Gin introduction practice
随机推荐
Ds-5/rvds4.0 variable initialization error
JS Es5 can also create constants?
Gin introduction practice
鼠标右键 自定义
新工作感悟~辞旧迎新~
dvajs的基础介绍及使用
AcWing 345. Cattle station solution (nature and multiplication of Floyd)
Match VIM from zero (0) -- Introduction to vimscript
LeetCode. 剑指offer 62. 圆圈中最后剩下的数
Hutool post requests to set the body parameter to JSON data
Yunna - work order management system and process, work order management specification
AcWing 361. 观光奶牛 题解(spfa求正环)
AcWing 1141. 局域网 题解(kruskalkruskal 求最小生成树)
C语言实例_3
糊涂工具类(hutool)post请求设置body参数为json数据
爬虫实战(六):爬笔趣阁小说
交叉验证如何防止过拟合
[advanced C language] 8 written questions of pointer
【唯一】的“万字配图“ | 讲透【链式存储结构】是什么?
设置Wordpress伪静态连接(无宝塔)