11.1作业

最新推荐文章于 2023-11-01 19:58:27 发布

Start___Over

最新推荐文章于 2023-11-01 19:58:27 发布

阅读量216

点赞数

本文链接：https://blog.csdn.net/Start___Over/article/details/78426550

版权

查找sdddrtkjsfkkkasjdddj字符串中，出现次数最多的字符和次数。

<!doctype html>
<html lang="en">
 <head>
  <meta charset="UTF-8">
  <title>查找最多字符串</title>
 </head>
 <body>
 </body>
 <script>
    var str  = "sdddrtkjsfkkkasjdddj";
    var max = 0;
    var count = 0;
    var letter = "";
    for(var i=1;i<=str.length;i++){
        for(var j=1;j<=str.length;j++){
            if(str[i] == str[j]){
            count++;
            }
        }
        if(count>=max){
            max = count;
            letter= str[i]
        }
        count = 0;
    }
    console.log("出现最多次的字符是"+letter+"，次数树"+max)
 </script>
</html>


![这里写图片描述](https://img-blog.csdn.net/20171102163828687?watermark/2/text/aHR0cDovL2Jsb2cuY3Nkbi5uZXQvU3RhcnRfX19PdmVy/font/5a6L5L2T/fontsize/400/fill/I0JBQkFCMA==/dissolve/70/gravity/SouthEast)

DELETE FROM team WHERE id  NOT IN
(SELECT id FROM
(SELECT MIN(id) AS id FROM team GROUP BY name) AS b);


判断 101-200 之间有多少个素数，并输出所有素数。

package demo2;

public class d2017111 {
public static void main(String[] args) {
int i;
int count = 0;
for (i = 100; i <= 200; i++) {
if ((i % 2 != 0) && (i % 3 != 0) && (i % 5 != 0) && (i % 7 != 0)) {
System.out.println(i);
count += 1;
}
}
System.out.println(“素数的个数：” + count);
}

}

Start___Over

关注

0
点赞
踩
0

收藏

觉得还不错? 一键收藏
0
评论
11.1作业

查找sdddrtkjsfkkkasjdddj字符串中，出现次数最多的字符和次数。<!doctype html><html lang="en"> <head> <meta charset="UTF-8"> <title>查找最多字符串</title> </head> <body> </body> <script> var str = "sdddrtkjsfkkkasjdd
复制链接

扫一扫