Analysis of Java programming problems

1、 Introduction

Joseph problem (sometimes called Josephus permutation, it is a problem that appears in computer science and mathematics. In computer programming algorithms, similar problems are also called Joseph Ring, also known as "throwing handkerchief problem")

example:

Len formed a circle and played the game of losing handkerchief. Start from the k-th person and count from 1. When you count to m, the person who counts m will quit the circle until there is only one person left in the circle.

Problem analysis and algorithm design

Joseph problem is not difficult, but there are many methods to solve it; There are many changes in the topic. An implementation method is given here.

In the title, len individuals form a circle, which inspires us to use a circular chain. We can use a structural array to form a circular chain. There are two members in the structure, one is the head node pointing to the first child, and the other is the judgment node temp (responsible for running a dragon suit).

The specific codes are as follows:

result:

summary

The above is all about the example analysis of Java programming in this paper. I hope it will be helpful to you. Interested friends can continue to refer to other related topics on this site. If there are deficiencies, please leave a message to point out. Thank you for your support!