package com;
import java.util.HashMap;
import java.util.Iterator;
import java.util.List;
import java.util.Map;
import java.util.Set;
public class PassRiver {
/**
* set 1 is replace of human 0 is replace of ghost
*/
String a = "1", b = "1", c = "1", d = "0", e = "0", f = "0";
static Map map = getMap();
public void topassriver() {
String[] a = getData();
/**
* 这种嵌套循环有点象排序算法不符合要求继续
*/
for (int i = 0; i < a.length - 1; i++) {
for (int j = i; j < a.length; j++) {
takeBoat(a[i], a[j]);
}
}
}
/**
* 类似递归
*/
int i = 0;
public void topassriver2() {
String[] a = getData();
for (int j = i; j < a.length; j++) {
takeBoat(a[i], a[j]);
}
if (i++ < a.length - 1) {
topassriver2();
}
}
public static void main(String[] args) {
PassRiver passRiver = new PassRiver();
passRiver.topassriver2();
}
/**
* tabe boat to pass river
*
* @param a
* human or ghost
* @param b
* human or ghost
*/
public static void takeBoat(String a, String b) {
if (map.get(a).equals(map.get(b))) {
if (map.get(a).equals("1")) {
// System.out.println(a + " and " + b + " is man" + "");
}
if (map.get(a).equals("0")) {
// System.out.println(a + " and " + b + " is ghost");
}
} else {
// a or b one is human and the other is ghost
System.out.println(a + " and " + b + " is can take boat" + "");
}
}
public static String[] getData() {
String[] a = new String[6];
int k = 0;
// if two human or two ghost is boat
Iterator iterator = map.keySet().iterator();
while (iterator.hasNext()) {
a[k] = (String) iterator.next();
k++;
}
return a;
}
/**
*
* @return
*/
public Map toPass() {
return null;
}
public static Map getMap() {
Map map = new HashMap();
map.put("a", "1");
map.put("b", "1");
map.put("c", "1");
map.put("d", "0");
map.put("e", "0");
map.put("f", "0");
return map;
}
}
int r=3,g=3;
public void cross(){
if(r>=g||3-r>=3-g){
r--;
}else{
g--;
}
this.cross();
}
package test;
import java.util.ArrayList;
import java.util.List;
public class Test {
private List<Integer> left = new ArrayList<Integer>();//左岸left.get(0)表示人的数量，左岸left.get(1)表示鬼的数量
private List<Integer> right = new ArrayList<Integer>();//右岸
/**
* 初始化左右两岸人鬼数量，左岸人鬼各三人，需要安全过到右岸
*/
public Test(){
left.add(3);
left.add(3);
right.add(0);
right.add(0);
}
public void checkSend() {
while(true){
try {
Thread.sleep(1000);
} catch (InterruptedException e) {
e.printStackTrace();
}
if(sendTwoPerson()){
//如果左岸人鬼都成功过河，结束循环
if(left.get(0)==0&&left.get(1)==0){
break;
}
if(backOneGhost()){
right.set(1,right.get(1)-1);
left.set(1,left.get(1)+1);
System.out.print("1鬼回来");
}else if(backTwoGhost()){
right.set(1,right.get(1)-2);
left.set(1,left.get(1)+2);
System.out.print("2鬼回来");
}else if(backOne()){
right.set(0,right.get(0)-1);
left.set(0,left.get(0)+1);
right.set(1,right.get(1)-1);
left.set(1,left.get(1)+1);
System.out.print("1人1鬼回来");
}else if(backOnePerson()){
right.set(0,right.get(0)-1);
left.set(0,left.get(0)+1);
System.out.print("1人回来");
}
}else if(sendTwoGhost()){
//如果左岸人鬼都成功过河，结束循环
if(left.get(0)==0&&left.get(1)==0){
break;
}
if(backOneGhost()){
right.set(1,right.get(1)-1);
left.set(1,left.get(1)+1);
System.out.print("1鬼回来");
}else if(backOne()){
right.set(0,right.get(0)-1);
left.set(0,left.get(0)+1);
right.set(1,right.get(1)-1);
left.set(1,left.get(1)+1);
System.out.print("1人1鬼回来");
}else if(backOnePerson()){
right.set(0,right.get(0)-1);
left.set(0,left.get(0)+1);
System.out.print("1人回来");
}
}else if(sendOne()){
//如果左岸人鬼都成功过河，结束循环
if(left.get(0)==0&&left.get(1)==0){
break;
}
if(backTwoGhost()){
right.set(1,right.get(1)-2);
left.set(1,left.get(1)+2);
System.out.print("2鬼回来");
}else if(backOnePerson()){
right.set(0,right.get(0)-1);
left.set(0,left.get(0)+1);
System.out.print("1人回来");
}
}
System.out.println(" 左岸剩余-->>>" +left.get(0)+"人"+" "+left.get(1)+"鬼 || "+" 右岸共-->>>" +right.get(0)+"人"+" "+right.get(1)+"鬼");
}
System.out.println(" 左岸-->>>" +left.get(0)+"人"+" "+left.get(1)+"鬼 || "+" 右岸共-->>>" +right.get(0)+"人"+" "+right.get(1)+"鬼 "+"成功过河");
}
/**
* 2人过河
* @return 是否成功
*/
public boolean sendTwoPerson() {
if(left.get(0)-2<0){//左岸人数不足2，送法失败
return false;
}else if(left.get(0)-2!=0 && left.get(0)-2 < left.get(1)){//左岸人数大于0且送走2人后小于鬼数目时送法失败
return false;
}else if(right.get(0)+2 < right.get(1)){//右岸送过2人后人数小于鬼数送法失败
return false;
}else{//否则送法成功，并更新两岸人鬼数目
left.set(0, left.get(0)-2);
right.set(0, right.get(0)+2);
System.out.print("2人过河");
return true;
}
}
/**
* 2鬼过河
* @return 是否成功
*/
public boolean sendTwoGhost() {
if(left.get(1)-2<0){//左岸鬼数不足2，送法失败
return false;
}else if(left.get(0)!=0 && left.get(0) < left.get(1)-2){//左岸人数大于0且送走2鬼后小于鬼数目时送法失败
return false;
}else if(right.get(0) != 0&&right.get(0) < right.get(1)+2){//右岸人数大于0且小于送来两鬼后鬼的数量送法失败
return false;
}else{//否则送法成功，并更新两岸人鬼数目
left.set(1, left.get(1)-2);
right.set(1, right.get(1)+2);
System.out.print("2鬼过河");
return true;
}
}
/**
* 一人一鬼过河
* @return 是否成功
*/
public boolean sendOne() {
if(left.get(0)-1<0 || left.get(1)-1<0){//左岸鬼数不足1，送法失败
return false;
}else if(left.get(0)-1 != 0 && left.get(0)-1 < left.get(1)-1){//左岸送走1人后书目不为0且人数少于送走1鬼后的鬼数，送法失败
return false;
}else if(right.get(0)+1 < right.get(1)+1){//右岸送来1人和1鬼后，人数少于鬼数送法失败
return false;
}else{//否则送法成功，并更新两岸人鬼数目
left.set(0, left.get(0)-1);
right.set(0, right.get(0)+1);
left.set(1, left.get(1)-1);
right.set(1, right.get(1)+1);
System.out.print("一人一鬼过河");
return true;
}
}
/**
* 回来1人
* @return 是否成功
*/
public boolean backOnePerson() {
if(right.get(0)-1<0){
return false;
}else if(right.get(0)-1==0 && right.get(1)==0){
return false;
}else if(right.get(0)-1 != 0 && right.get(0)-1 < right.get(1)){
return false;
}else if(left.get(0)+1 < left.get(1)){
return false;
}else{
return true;
}
}
/**
* 回来1鬼
* @return 是否成功
*/
public boolean backOneGhost() {
if(right.get(1)-1<0){
return false;
}else if(right.get(0)==0 && right.get(1)-1==0){
return false;
}else if(right.get(0)!=0 && right.get(0) < right.get(1)-1){
return false;
}else if(left.get(0)!=0 && left.get(0) < left.get(1)+1){
return false;
}else{
return true;
}
}
/**
* 回来2人
* @return 是否成功
*/
public boolean backTwoPerson() {
if(right.get(0)-2<0){
return false;
}else if(right.get(0)-2==0 && right.get(1)==0){
return false;
}else if(right.get(0)-2 < right.get(1)){
return false;
}else if(left.get(0)+2 < left.get(1)){
return false;
}else{
return true;
}
}
/**
* 回来2鬼
* @return 是否成功
*/
public boolean backTwoGhost() {
if(right.get(1)-2<0){
return false;
}else if(right.get(0)==0 && right.get(1)-2==0){
return false;
}else if(right.get(0)!=0 && right.get(0) < right.get(1)-2){
return false;
}else if(left.get(0)!=0&&left.get(0) < left.get(1)+2){
return false;
}else{
return true;
}
}
/**
* 回来1人1鬼
* @return 是否成功
*/
public boolean backOne() {
if(right.get(1)-1<0 || right.get(0)-1<0){
return false;
}else if(right.get(0)-1==0 && right.get(1)-1==0){
return false;
}else if(right.get(0)-1 < right.get(1)-1){
return false;
}else if(left.get(0)+1 < left.get(1)+1){
return false;
}else{
return true;
}
}
public static void main(String[] args){
Test t = new Test();
t.checkSend();
}
}
