檸檬微趣

1. 將java的鏈表升序排序，鏈表用Class Node{int val,Node next}實現

import java.util.Comparator;
import java.util.PriorityQueue;
import java.util.Scanner;/*** 輸入一串數字，放入list中，實現sortList，返回升序的list*/
public class Test1 {public static void main(String[] args) {Scanner in = new Scanner(System.in);Node head = new Node();head.value = in.nextInt();head.next = null;Node temp = head;for(int i=0;i<8;i++){Node node = new Node();node.value = in.nextInt();node.next = null;temp.next = node;temp = temp.next;}head = sortList(head);System.out.print(head.value);head = head.next;while(head!=null){System.out.print(" "+head.value);head = head.next;}}public static Node sortList(Node head){PriorityQueue<Node> queue = new PriorityQueue<>(new Comparator<Node>() {@Overridepublic int compare(Node o1, Node o2) {return o1.value-o2.value;}});while(head!=null){queue.offer(head);head = head.next;}head = queue.poll();Node temp = head;while(!queue.isEmpty()){temp.next = queue.poll();temp = temp.next;}temp.next = null;return head;}
}class Node{int value;Node next;
}

2. 實現簡單的模式匹配
   • .匹配任意字符
   • *和前面一個字符組合，表示匹配0個或多個該字符
   • ?和前面一個字符組合，表示匹配1個或多個該字符

import java.util.Scanner;/*** 實現簡單的模式匹配* . 匹配任意字符* * 和前面一個字符組合，表示匹配0個或多個該字符* ? 和前面一個字符組合，表示匹配1個或多個該字符** 示例：*  輸入：*      3*      aa aa*      aa aaa*      aaa aa*  輸出：*      true*      false*      false** 示例：*  輸入：*      4*      a a.**      aa aa.?*      aa a.?*      ab a.?*  輸出：*      true*      false*      true*      true*/
public class Test2 {public static void main(String[] args) {Scanner in = new Scanner(System.in);int n = in.nextInt();for (int i = 0; i < n; i++) {char[] aChars = in.next().toCharArray();char[] bChars = in.next().toCharArray();int len = bChars.length;//k用于標記aChars的下標int k = 0;//j用于標記bChars的下標int j = 0;boolean end = false;boolean finish = false;int count = 0;while(true){if(j+1<len){switch (bChars[j+1]){case '*':{count = 0;while(bChars[j]=='.'||aChars[k]==bChars[j]){k++;count++;if(k>=aChars.length){end = true;break;}}k++;j+=2;break;}case '?':{count = 0;while(bChars[j]=='.'||aChars[k]==bChars[j]){k++;count++;if(k>=aChars.length){end = true;break;}}if(count>0){k++;j+=2;}else{finish = true;}break;}default:{if(bChars[j]=='.'){j++;k++;}else{if(aChars[k]==bChars[j]){j++;k++;}else{finish = true;}}break;}}}else{if(bChars[j]=='.'||bChars[j]==aChars[k]){j++;k++;}else{finish = true;}}if(k>=aChars.length||j>=bChars.length){end = true;}if(finish||end){break;}}if(finish){System.out.println(false);}else{if(k<aChars.length){System.out.println(false);}else if(j<bChars.length){if((bChars.length-j)%2==0){boolean flag = false;while(bChars.length-j>0){if(!(bChars[j]=='.'&&bChars[j+1]=='*')){flag = true;System.out.println(false);break;}else{j+=2;}}if(!flag){System.out.println(true);}}else{System.out.println(false);}}else{System.out.println(true);}}}}
}

3. 野豬騎士？翻譯過來就是：給一個數組，數組中的第i個元素，需要輸出：數組下標比i大的集合中，值也比array[i]大的集合中的最小值。

import java.util.*;/*** 野豬騎士？* 給一個數組，數組中的第i個元素，需要輸出：數組下標比i大的集合中，值也比array[i]大的集合中的最小值。** 示例：*  輸入：*      4 2 1 3*  輸出：*      -1 3 3 -1** 示例：*  輸入：*      8 4 9 3 5 1 7 2 6*  輸出：*      9 5 -1 5 6 2 -1 6 -1*/
public class Test3 {public static void main(String[] args) {Scanner in = new Scanner(System.in);List<Integer> list = new ArrayList<>();while(in.hasNextInt()){list.add(in.nextInt());}int[] array = new int[list.size()];for (int i = 0; i < list.size(); i++) {array[i] = list.get(i);}PriorityQueue<Integer> queue = new PriorityQueue<>();int[] result = new int[list.size()];for (int i = list.size()-1; i >= 0; i--) {Stack<Integer> stack = new Stack<>();while(!queue.isEmpty()){if(queue.peek()<array[i]){stack.add(queue.poll());}else {result[i] = queue.peek();break;}}while(!stack.isEmpty()){queue.add(stack.pop());}if(result[i]==0){result[i]=-1;}queue.add(array[i]);}StringBuilder sb = new StringBuilder();sb.append(result[0]);for (int i = 1; i < list.size(); i++) {sb.append(" "+result[i]);}System.out.println(sb.toString());}
}

4. 將一個整數轉換為一個7bit的數據格式（沒細看）