REST-spring-security

基于springboot实现的多线程并发任务，创建多任务并发执行的DEMO(Multi-threaded concurrent tasks based on spring boot to create DEMO for multi-task concurrent execution)

说明：  前端预览文件，解压使用注意要修改读取文件路径，使用前安装openoffice4程序，应用程序安装地址要和demo中地址匹配(Front-end preview file, decompression attention should be paid to modify the read file path, install OpenOffice 4 program before use, application installation address to match the address in demo)

java,HttpClient,auto login google

Constants for intents related to showing speech recognition results.

说明：  一只青蛙一次可以跳上1级台阶，也可以跳上2级。求该青蛙跳上一个n级的台阶总共有多少种跳法。要求：分别用普通方法和递归方法实现(A frog can jump up a step or two at a time. Find out how many jumping methods the frog can use to jump up an n-step. Requirements: Implemented by common method and recursive method respectively)

这个例子主要针对初学者，对viewpager的扩展用法，一目了然。(This example is mainly for beginners, the expansion of the use of viewpager, at a glance.)

一款一个益智类的手机游戏源码,可自己进行编译生成相应的安装文件(A puzzle class of mobile game source code, can be compiled to generate the corresponding installation files.)

springmvc security 权限管理例子(springmvc security )

说明：  本书以Python为样本，不仅介绍了编程的基本概念，还着重讲解了 编程语言的范式（面向过程、面向对象、面向函数），并把编程语言的 范式糅在Python中，让读者不仅学会Python，未来在学习其他编程语言 时也变得更加容易。(aking Python as a sample, this book not only introduces the basic concepts of programming, but also focuses on the programming language paradigm (process-oriented, object-oriented, function-oriented), and incorporates the programming language paradigm into Python, so that readers can not only learn Python, but also become easier to learn other programming languages in the future.)

说明：  基本算法： 采用博弈比较常用的策略。 计算机下子前，分别对玩家和电脑棋型进行评估，然后根据棋型对每一位置打分（玩家和电脑在同一点的分数不同），比如活三100分，冲四1000分等，然后根据每个落子点分数进行选择。采用极大极小值策略，进行多步计算。(Basic algorithm: The game strategy is commonly used. Before computer playing, players and computer chess models are evaluated separately, and then each position is scored according to the chess pattern (players and computers have different scores at the same point), such as live three hundred points, go four thousand points, and then choose according to the score of each falling point. Multi-step calculation is carried out by using the minimax strategy.)