当前位置:网站首页>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);
}
边栏推荐
- 字符串的相关编程题
- Ds-5/rvds4.0 variable initialization error
- AcWing 344. Solution to the problem of sightseeing tour (Floyd finding the minimum ring of undirected graph)
- Reptile practice (VI): novel of climbing pen interesting Pavilion
- Baidu flying general BMN timing action positioning framework | data preparation and training guide (Part 2)
- AcWing 1140. Shortest network (minimum spanning tree)
- 字符串转成日期对象
- AcWing 904. 虫洞 题解(spfa求负环)
- Use nodejs to determine which projects are packaged + released
- 场景实践:基于函数计算快速搭建Wordpress博客系统
猜你喜欢
随机推荐
永久的摇篮
搭建【Redis in CentOS7.x】
AcWing 1141. LAN problem solving (kruskalkruskal finding the minimum spanning tree)
Reptile practice (VI): novel of climbing pen interesting Pavilion
C语言实例_3
LeetCode:1175. 质数排列
Using the entry level of DVA in taro3.*
Appium基础 — Appium Inspector定位工具(一)
Gin introduction practice
AcWing 344. 观光之旅题解(floyd求无向图的最小环问题)
Make Jar, Not War
AcWing 904. Wormhole solution (SPFA for negative rings)
AcWing 1142. 繁忙的都市 题解(最小生成树)
Taro2.* applet configuration sharing wechat circle of friends
grep查找进程时,忽略grep进程本身
C language instance_ five
AcWing 346. Solution to the problem of water splashing festival in the corridor (deduction formula, minimum spanning tree)
Long press the button to execute the function
Appium自动化测试基础 — uiautomatorviewer定位工具
The cradle of eternity









