11.1作业练习

MySQL 编程题

/*
Navicat MySQL Data Transfer

Source Server         : java96
Source Server Version : 50556
Source Host           : localhost:3306
Source Database       : 11.1

Target Server Type    : MYSQL
Target Server Version : 50556
File Encoding         : 65001

Date: 2017-11-01 23:36:45
*/

SET FOREIGN_KEY_CHECKS=0;

-- ----------------------------
-- Table structure for team
-- ----------------------------
DROP TABLE IF EXISTS `team`;
CREATE TABLE `team` (
  `id` int(10) NOT NULL AUTO_INCREMENT,
  `name` varchar(255) DEFAULT NULL,
  PRIMARY KEY (`id`)
) ENGINE=InnoDB AUTO_INCREMENT=7 DEFAULT CHARSET=latin1;

-- ----------------------------
-- Records of team
-- ----------------------------
INSERT INTO `team` VALUES ('1', 'a');
INSERT INTO `team` VALUES ('2', 'b');
INSERT INTO `team` VALUES ('3', 'b');
INSERT INTO `team` VALUES ('4', 'a');
INSERT INTO `team` VALUES ('5', 'c');
INSERT INTO `team` VALUES ('6', 'c');

要求:执行一个删除语句，当 name 列上有相同时,只保留 iD 这列上值小的
DELETE FROM team WHERE id IN (SELECT t.id FROM (SELECT MAX(id) AS id FROM team GROUP BY name) AS t);

JavaScript 编程题

<script>
    window.onload = function() {
        // 定义一个字符串
        var str = "sdddrtkjsfkkkasjdddj";
        // 记录次数
        var count = 0;          
        // 定义字母
        var strMax = "";
        // 循环查找
        for (var i = 0; i < 20; i++) {
            var countTemp = 0;
            var varStr = String.fromCharCode(97+i);
            // 循环嵌套
            for (var m = 0; m < str.length; m++) {
                var n = str.indexOf(varStr,m);
                if (n > -1) {
                    // 计数变量自增
                    countTemp++;
                    // 修改查找起始位置
                    m = n;
                }
            }
            // 判断出现的次数是否大于之前的次数
            if(countTemp > count){
                // 保存大数
                count = countTemp
                strMax = varStr;
            }               
        }
        // 输出
        console.log("出现最多次数的字母是："  + strMax + "，出现次数为：" + count);           
    }
</script>

Java 编程题

package demo;

public class Java7 {
        public static void main(String[] args)
        {
            //for循环遍历101-200
            for(int i = 101; i < 200; i++)
            {
                boolean b = false;

                //内层循环判断i是否为素数
                for(int j = 2; j <= i-1; j++)
                {

                    //除了1和它本身以外，如果i可以整除其他数就b = false
                    if( i % j == 0 )
                    {
                        b = false;
                        break;
                    }

                    //如果不能整除就b = true
                    else
                    {   
                        b = true;
                    }
                }

                //如果b = true就打印出来
                if(b == true)
                {
                    System.out.println(i);
                }
            }
        }
    }