约瑟夫环

输出整个过程

	public static void process(int n, int m) {
		if (n <= 0 || m <= 0 ) return;

		if (n == 1) {
			System.out.println(1);
			return;
		}

		Node firstNode = new Node(1);
		Node preNode = firstNode;

		for (int i = 2; i <= n; i ++) {
			Node node = new Node(i);

			preNode.setNext(node);

			preNode = node;

			if (i == n) {
				node.setNext(firstNode);
			}
		}

		Node current = firstNode;

		int i = 0;

		while(current != current.next) {
			if (++ i == m) {
				System.out.print(current.index + "  ");
				preNode.next = current.next;
				current = current.next;
				i = 0;
			} else {
				preNode = current;
				current = current.next;
			}
		}

		System.out.println(current.index);

	}

时间复杂度为O(n * m)，那么如果我们不要求过程的话，只要看最终的结果，可以通过

	public static void justProcessForResult(int n, int m) {
		int k = 0;

		for (int i = 1; i <= n; i ++) {
			k = (k + m) % i;
		}

		System.out.println(k + 1);
	}

在O(n)时间内就能够算出来