算法第四版习题2.1.14

算法第四版习题2.1.14的一些个人理解

• 题目:出列排序。说说你会如何将一副扑克牌排序（花色顺序是黑桃、红桃、梅花和方片），限制条件是只能查看最上面的两张牌，交换最上面的两张牌，或是将最上面的一张牌放到这摞牌的最下面。

• 思路:我的思路就是暴力求解
  我是将扑克牌按照1-52的序号排序的,对于一副乱序的牌,由于你只能看开头两张,所以的话只能通过N - 1轮排序之后,你才可以确定你已经排好序了,每一轮的目标就是找到最小的那一张牌(找最大的也可以),然而在这些牌里有一部分是你已经排好序的,就是每一轮最低下的那Num - i - 1张牌,所以这里需要加一个判断:如果这两张牌是未知顺序的,那么就将大牌放在最下面,如果是已经确认排好了的,就将小牌放在下面,在最后第N - 1轮结束之后,将最上面一张牌放到最后.下面贴代码

package chapter2.HomeWork2_1_14;
import edu.princeton.cs.algs4.StdOut;
import edu.princeton.cs.algs4.StdRandom;
public class CardSort {
    private final int Num_card = 52;
    private final String[] color = {"红桃","方片","梅花","黑桃"};
    private  int[] cards ;

    public CardSort()
    {
        cards = new int[Num_card];
        for (int i = 0; i < Num_card; i++)
            cards[i] = i;
        show();
    }

    public  void show()
    {
        System.out.println("\n牌堆里面的牌:");
        for (int i = 0; i < Num_card; i++ )
        {
            int c = cards[i]/13;
            int mod = (cards[i] % 13) + 1;

            if(i % 13 == 0)
                System.out.println();
            if (mod >=2 && mod <= 10 )
            {
                System.out.print(color[c] + mod + " ");
            }
            else if(mod == 11)
            {
                System.out.print(color[c] + "J ");
            }
            else if (mod == 12)
            {
                System.out.print(color[c] + "Q ");
            }
            else if(mod == 13)
            {
                System.out.print(color[c] + "K ");
            }
            else
            {
                System.out.print(color[c] + "A ");
            }
        }
    }

    public void shuffle()
    {
        StdRandom.shuffle(cards);
        show();
    }

    public void sort()
    {
        for (int i = 0; i < Num_card - 1; i++)
        {
            for (int j = 0; j < Num_card; j++) {
                if(j < Num_card - i - 1) {
                    if (less(cards[0], cards[1]))
                        exchTop(cards);
                }
                else{
                    if(less(cards[1],cards[0]))
                        exchTop(cards);
                }
                exchToBottom(cards);
            }
        }
        exchToBottom(cards);
    }

    private static void exchTop(int[] a) {
        int temp = a[0];
        a[0] = a[1];
        a[1] = temp;
    }

    private static void exchToBottom(int[] a)
    {
        int temp = a[0];
        for (int i = 0; i < a.length - 1; i++)
        {
            a[i] = a[i + 1];
        }
        a[a.length - 1] = temp;
    }

    private static boolean less(int  v, int  w) {
        return v < w;
    }

    public static void main(String[] args) {
        CardSort card = new CardSort();
        card.shuffle();
        card.sort();
        System.out.println("\n排序之后的牌堆:");
        card.show();
    }
}