--- lang: zh-tw tags: java, algorithm # 在此輸入標籤(以","分隔) image: null # 在此輸入預覽圖片網址 --- # 1092 中興大學資工系必修課-演算法 ![](https://img.shields.io/github/last-commit/twjmy/algorithms?color=success) ![](https://img.shields.io/github/languages/top/twjmy/algorithms) ![](https://img.shields.io/badge/dynamic/json?color=aqua&query=%24.viewcount&label=%E9%BB%9E%E6%93%8A%E6%AC%A1%E6%95%B8&suffix=%E6%AC%A1&url=https%3A%2F%2Fhackmd.io%2F%40VJ%2F1092-algorithms-nchu%2Finfo) [![hackmd-github-sync-badge](https://hackmd.io/fRHOXqCNSx6Wd3yEKjQf2w/badge)](https://hackmd.io/@VJ/1092-algorithms-nchu/edit?both) <details open><summary>目錄</summary> + [HW01 - ArrayData](#HW01---ArrayData) + [HW02 - ThreeSum](#HW02---ThreeSum) + [HW03 - HillFinding](#HW03---HillFinding) + [HW04 - One 0K Rock](#HW04---One-0K-Rock) + [HW05 - LLK](#HW05---LLK) + [HW06 - Dessert Desert](#HW06---Dessert-Desert) + [HW07 - Buy Phone](#HW07---Buy-Phone) + [HW08 - Buy Phone v2](#HW08---Buy-Phone-v2) + [HW09 - LSD](#HW09---LSD) + [HW10 - Sorting](#HW10---Sorting) + [HW11 - GroupCounting](#HW11---GroupCounting) </details> --- ## HW01 - ArrayData ### Assignment 會給一個Array，分別求Array的最大值和最小值 | Example | Method Calling / Return | | ------- | --------------------------- | | Input | `ArrayData(new int{1,2,3})` | | Output | `int min() = 3, max() = 1` | ### Abstract class ```java=! public abstract class ArrayData { public int [] A; public abstract int max(); public abstract int min(); } ``` ### Solution 由於助教沒有給定傳入陣列的方式，一開始假設助教使用 `HW01.A=測資`，所以直接實作 `max()`、`min()` ```java=! public class HW01_1 extends ArrayData{ public int max(){ int max = A[0]; for(int i = 1; i < A.length; i++) if(A[i]>max) max=A[i]; } public int min(){ int min = A[0]; for(int i = 1; i < A.length; i++) if(A[i]<min)min=A[i]; } } ``` 結果當然是報錯的，因為助教是用建構元 `ArrayData(int[])` 來建構我們的 `class` 成物件再用這個物件呼叫 `max()`、`min()`，所以應該這樣實作 ```java=! public class HW01_2 extends ArrayData{ public HW01_2(final int[] A) { this.A = A; } public int max(){ int max = A[0]; for(int i = 1; i < A.length; i++) if(A[i]>max) max=A[i]; } public int min(){ int min = A[0]; for(int i = 1; i < A.length; i++) if(A[i]<min)min=A[i]; } } ``` 這樣實作的時間複雜度會是 `O(N)`。但既然助教在建構元就傳入陣列了，我們可以在建構的時候就找出最大、最小值再呼叫 ```java=! public class HW01_3 extends ArrayData{ public int max, min; public HW01_3(final int[] A){ max = min = A[0]; for(int i = 1; i < A.length; i++) if(A[i]>max) max = A[i]; if(A[i]<min) min = A[i]; } } public int max(){ return max; } public int min(){ return min; } } ``` 理論上助教如果計時是在呼叫 `max()`、`min()` 前後才開始計時，這個版本相當於直接回傳答案，所以時間複雜度會是 `O(1)`。 --- ## HW02 - ThreeSum ### Assignment 計算陣列中任意三個數字相加為零的組合數 (數組中不會有重複的數字) | Example | Method Calling / Return | | ------- | --------------------------------- | | Input | `int[] A = {-1,1,2,4,8,-3}` | | Output | `int T_sum(A) = 2` | 分別是 (1,2,-3) 以及 (-1,4,-3) 2組 ### Abstract class ```java=! public abstract class ThreeSum { public abstract int T_sum(int[] A); } ``` ### Solution #### Brute-force ```java=! public class HW02_1 extends ThreeSum{ public int T_sum(int[] A){ int count = 0; for(int i = 0; i < N; i++) for(int j = i+1; j < N; j++) for(int k = j+1; k < N; k++) if(a[i]+a[j]+a[k] == 0) count++; return count; } } ``` 暴力解，時間複雜度是 `O(N³)`。 #### Binary search 參考老師的[投影片](https://www.dropbox.com/s/cxrvhuj9mnk2uio/%E6%BC%94%E7%AE%97%E6%B3%95%E8%AC%9B%E7%BE%A92020.pdf) Lecture 2 第 40,42 頁裡的程式碼，整合、修改一下 ```java=! import java.util.Arrays; public class HW02_2 extends ThreeSum{ public int T_sum(int[] a){ Arrays.sort(a); int N = a.length-2; int cnt = 0; for(int i = 0; i < N; i++){ int key = -a[i]; int lo = i+1, hi = a.length-1; while(lo < hi){ int sum = a[lo] + a[hi]; if(key < sum) hi--; else if (key > sum) lo++; else{ hi--; lo++; cnt++; } } } return cnt; } } ``` 這樣時間複雜度是 `O(N²)`。另外由於老師不讓我們 `import` ，所以我們要自己實作 `sort(int[])`。 --- ## HW03 - HillFinding ### Assignment **Input**: An array. In this mission we find the peak of the array, then find out which cutting position of the array which could produce a sorted array. **Final return**: Cutting position of the array <details> <summary>Please refer to the attached .jpg file to see the example</summary> <img src="https://lms.nchu.edu.tw/sysdata/attach/exercise.30426/2390c9e66e43ce6dabe3b00596cc3e52.jpg" alt="Example 1"> <img src="https://lms.nchu.edu.tw/sysdata/attach/exercise.30426/8798c80c1fad0655d38c5e51c9c20ae8.jpg" alt="Example 2"> </details> TestCase(input) will not include arrays like: 1. All same: `8,8,8,8,8,8` 2. Whole ascending: `1,2,3,4,5,6,7` | Example | Method Calling / Return | | -------- | ---------------------------- | | Input 1 | `int[] A1 = {5,6,7,1,2,3,4}` | | Output 1 | `int H_Finding(A1) = 3` | | Input 2 | `int[] A2 = {5,7,8,8,1,3,4}` | | Output 2 | `int H_Finding(A2) = 2` | ### Abstract class ```java=! public abstract class HillFinding { public abstract int H_Finding(int[] A); } ``` ### Solution #### Brute-force 因為題目說不會有 `1,2,3,4,5,6,7` 的情況，可以這樣實作 ```java=! public class HW03_1 extends HillFinding { public int H_Finding(int[] A){ int i = 0; for(i=0; A[i]<=A[++i];); return A.length-1-i; } } ``` 暴力解，時間複雜度是 `O(N)`。 #### Binary search 同樣，參考老師的[投影片](https://www.dropbox.com/s/cxrvhuj9mnk2uio/%E6%BC%94%E7%AE%97%E6%B3%95%E8%AC%9B%E7%BE%A92020.pdf) Lecture 2 第 40 頁裡的程式碼，修改一下 ```java=! public class HW03_2 extends HillFinding { public int H_Finding(final int[] A) { final int END = A.length-1; int lo = 0, hi=END; for(mid=hi>>>1; lo <= hi; mid = lo+hi>>>1){ if(mid < END && A[mid+1] < A[mid]) return END-i-1; else if(mid > lo && A[mid-1] > A[mid]) return END-i; else if(A[hi]>A[mid]) hi = mid-1; else lo = mid+1; } int i; for(i=0; A[i]<=A[++i];); // 最後手段 return END-i; } } ``` 在 `for()` 迴圈裡找不到答案會是例外狀況，所以我加了最後手段，這樣時間複雜度是 `O(lgN)`。 --- ## HW04 - One 0K Rock ### Assignment Your program will take a bunch of string arrays as input. Please determine whether a given array comes from { 0<sup>k</sup>1<sup>k</sup> \| k ∈ Z<sup>+</sup> } ( the input arrays do not contain empty string and non 0,1 characters) For example, 1. Input: `["0011","00111"]` , Output: `[true,false]` 2. Input: `["01","1100","1111"]` , Output: `[true,false,false]` | Example | Method Calling / Return | | -------- | -------------------------------------------- | | Input 1 | `String[] str1 = {"0011","00111"}` | | Output 1 | `boolean[] one0k(str1) = {true,false}` | | Input 2 | `String[] str2 = {"01","1100","1111"}` | | Output 2 | `boolean[] one0k(str2) = {true,false,false}` | ### Abstract class ```java=! public abstract class One_0k_rock { public abstract boolean[] one0k(String[] str); } ``` ### Solution #### Brute-force (Regular Expression) 由於 Java 的 String 內建的 [`matches(String)`](https://docs.oracle.com/javase/9/docs/api/java/lang/String.html#matches-java.lang.String-) 可以讓我們使用正則表達式判斷，取字串長度的一半(`len>>>1`)作為 0<sup>k</sup>1<sup>k</sup> 裡的 k ，所以可以這樣實作 ```java=! public class HW04_1 extends One_0k_rock { public boolean[] one0k(final String[] str) { final boolean[] result = new boolean[str.length]; for(int i = 0; i < str.length; i++){ final int len = str[i].length(); if((len&1)==1) continue; // 奇數個的情況跳過: l&1 相當於 l%2 final int half = len>>>1; if(str[i].matches("0{"+half+"}1{"+half+"}")) result[i] = true; } return result; } } ``` 這樣的實作我們無法得知時間複雜度是多少，因為我們不是寫 [`matches(String)`](https://docs.oracle.com/javase/9/docs/api/java/lang/String.html#matches-java.lang.String-) 這個函式的人，但結果都比下面來的慢。 #### Left-right compare 一個基本的想法，從左邊到中間數過去第一個、右邊到中間數過來第一個開始比較，不對就跳出迴圈，可以這樣實作 ```java=! public class HW04_2 extends One_0k_rock { public boolean[] one0k(final String[] str) { final boolean[] result = new boolean[str.length]; for(int i=0,j; i<str.length; ++j) { final String s = str[i]; final int len = s.length(); if((len&1)==1) continue; final int end = len -1; for(j = -1; s.charAt(++j)=='0' && s.charAt(end-j)=='1';); // j 如果指到 len>>>1 就代表條件通過了 (len>>>1)-1 次 if((len>>>1)==j) result[i] = true; } return result; } } ``` 你可能會想問，為什麼不直接 `str[i].charAt(++j)<str[i].charAt(l-1-j)` 就好？答案是因為用 `chatAt(int)` 也需要耗時間，我直接生一個立即的字符來比較，如果不對當下直接跳出迴圈，就可以省去多一次呼叫的時間。這樣對於每個正確的字串來說時間複雜度會是 `T(5+½N+½N+2) = T(7+N) ~ O(N)` 。 #### Left-right compare - from middle 感謝 [@bettyteng21](https://github.com/bettyteng21) 提出，如果從中間開始比，可以同時判斷奇數的情況，省去一個步驟，可以這樣實作 ```java=! public class HW04_3 extends One_0k_rock { public boolean[] one0k(final String[] str) { final boolean[] result = new boolean[str.length]; for(int i=0; i<str.length; ++i) { final String s = str[i]; final int end = s.length()-1; try{ for(int j=(end>>>1)+1; s.charAt(--j)=='0' && s.charAt(end-j)=='1';); }catch(IndexOutOfBoundsException __){ // j 如果指到 -1 就代表條件通過了 len>>>1 次 result[i] = true; } } return result; } ``` 快那麼一點，這樣對於每個正確的字串來說時間複雜度會是 `T(3+½N+½N+1) = T(4+N) ~ O(N)` ，但我有看過 [@bettyteng21](https://github.com/bettyteng21) 的[程式碼](https://github.com/bettyteng21/1092-Algorithm/blob/main/alghw04/src/HW04_4108056007_4.java)，時間複雜度算下來其實比上面從前面開始比的方法來的高，但就比較快，推測是因為測資 `false` 的結果居多所導致。 --- ## HW05 - LLK ### Assignment Your program will take a set that consists of two-dimensional points as input. Please determine whether the given set containing three points lie in a line. Here is our sample testdata: `[[1,1],[2,2],[3,6]]` | Example | Method Calling / Return | | ------- | ------------------------------------- | | Input | `int[][] array = {{1,1},{2,2},{3,6}}` | | Output | `boolean checkLLK(array) = false` | ### Abstract class ```java=! public abstract class LLK{ public abstract boolean checkLLK(int[][] array); } ``` ### Solution [參考](https://github.com/liao2000/Algorithms-Meet-Java/tree/master/Homework/HW04_PCL) 施工中...:gear: --- ## HW06 - Dessert Desert ### Assignment Your program will take an integer arrays as input. Please return the maximum possible number of blocks in a valid partitioning. A valid partitioning of the integer array is defined as follows. + The numbers are split into blocks — groups of consecutive numbers. The block<sub>i,j</sub> consists of number n<sub>i</sub>, n<sub>i+1</sub>, ..., n<sub>j</sub>. A block can have only a single number. + Every number belongs to one block only. + The partitioning should satisfy the condition that after each block is sorted, the whole sequence becomes sorted as well. | Example | Method Calling / Return | | ------- | ------------------------------------------ | | Input | `int[][] inputArr = {{1,1,1,1,1,1,1},{1,3,5,7,9},{1,2,3},{5,4,3,2,1},{2,1,3,2}}` | | Output | `int[] maxBlocks(inputArr) = {7,5,3,1,2}` | ### Abstract class ```java=! public abstract class Dessert_Desert{ public abstract int[] maxBlocks(int[][] inputArr); } ``` ### Solution [參考](https://leetcode.com/problems/max-chunks-to-make-sorted-ii/) 施工中...:gear: --- ## HW07 - Buy Phone ### Assignment Your program will take a two-dimensional integer array as input. Each element represents a smartphone model which contains two features (e.g. screen size and performance ranking). Please return an array containing a list of unbeatable smartphone models (In other words, filter out the phone models that can be beat by some model). Given two items A =(X<sub>a</sub>, Y<sub>a</sub>) and B =(X<sub>b</sub>, Y<sub>b</sub>), Item A beats Item B iff x<sub>a</sub>≥x<sub>b</sub> and y<sub>a</sub>≥y<sub>b</sub> | Example | Method Calling / Return | | ------- | ------------------------------------------ | | Input | `int[][] inputArr = {{1,1},{2,4},{2,10},{5,4},{4,8},{5,5},{8,4},{10,2},{10,1}}` | | Output | `int[][] bestPhone(inputArr) = {{2,10},{4,8},{5,5},{8,4},{10,2}}` | ### Abstract class ```java=! public abstract class Buy_Phone{ public abstract int[][] bestPhone(int[][] inputArr); } ``` ### Solution 施工中...:gear: --- ## HW08 - Buy Phone v2 ### Assignment Your program will take a six-dimensional integer array as input. Each element represents a smartphone model which contains **six** features (e.g. screen size, performance ranking and etc.). Please return an sorted array containing a list of unbeatable smartphone models (In other words, filter out the phone models that can be beaten by some model). The return array should be sorted by the first element of each array in the output. | Example | Method Calling / Return | | ------- | ------------------------------------------ | | Input | `int[][] inputArr = {{8,7,7,4,2,1},{2,4,4,6,2,1},{4,0,5,1,3,2},{5,2,4,3,7,3},{7,5,6,9,8,9}}` | | Output | `int[][] bestPhone(inputArr) = {{7,5,6,9,8,9},{8,7,7,4,2,1}}` | ### Abstract class ```java=! public abstract class Buy_Phone_v2{ public abstract int[][] bestPhone(int[][] inputArr); } ``` ### Solution 施工中...:gear: --- ## HW09 - LSD ### Assignment Your program will take a two-dimensional integer array as input. Each element in the array represents nodes lined together Please return the longest shortest-path in the given graph. Given a graph G = (V, E), find max<sub>u,v</sub> d(u, v), where d(u,v) denotes the shortest path length between node u and node v, for all possible u, v (In this home work, You may use `java.util.collections`、 `java.util.ArrayList` 、 `java.util.Stack`, but `java.util.*` is not allowed.) | Example | Method Calling / Return | | ------- | ------------------------------------------ | | Input | `int[][] array = {{0,1},{0,2},{0,4},{1,3},{1,4},{2,5},{6,7}}` | | Output | `int Distance(array) = 4` | ### Abstract class ```java=! public abstract class LSD{ public abstract int Distance(int[][] array); } ``` ### Solution 施工中...:gear: --- ## HW10 - Sorting ### Assignment Your program will take an integer array as input. Please return the sorted ascending array in the given array. | Example | Method Calling / Return | | ------- | ----------------------------------------- | | Input | `int[] A = {-1,2,5,9,8,7,1,3,2}` | | Output | `int[] sorting(A) = {-1,1,2,2,3,5,7,8,9}` | ### Abstract class ```java=! public abstract class SortingArray { public abstract int[] sorting(int[] A); } ``` ### Solution 施工中...:gear: --- ## HW11 - GroupCounting ### Assignment Your program will take two string array as input. The points corresponding to the same index in the array will be connected to form an edge. Please return the number of the groups in the given array. <details> <summary>Example</summary> <img src="https://i.imgur.com/cftSW8J.png" alt="Example"/> </details> | Example | Method Calling / Return | | ------- | ------------------------------------------ | | Input | `String[] A = {"A","B","B","C","B","D","F","G"}, B = {"E","E","C","D","D","E","H","H"}` | | Output | `int count(A,B) = 2` | ### Abstract class ```java=! public abstract class GroupCounting { public abstract int count(String[] A, String[] B); } ``` ### Solution 施工中...:gear:
Last changed by  
 
VJ
本名談維傑，台灣出生。國小因故到澳門念書，國高中都唸當地同一所學校，大學想說回來台灣，就讀於中興大學資訊工程系，任35-36屆資訊科學研習社社長。
1292

Read more

php × IIS (WITHOUT XAMPP)

[ ] 微軟官方文件: Using FastCGI to Host PHP Applications on IIS 7 php 官方文件 [x] Windows 系统下的安装 [x] 在 Windows 上手动安装 PHP [x] PHP 在 Microsoft Windows 下的命令行方式 [x] PHP For Windows MySQL & phpMyAdmin [ ] 在Windows 7 x64平台的IIS架設PHP與MySQL

4/17/2023
Windows VSCode MinGW C 語言開發攻略

<small><i class="fa fa-fw fa-github"></i>VJ</small> 參考微軟官方文件 Get Started with C++ and Mingw-w64 in Visual Studio Code 安裝 下載並安裝 Windows VS Code 給 VS Code 安裝 C/C++延伸模組. 按此頁指示，下載並安裝 MSYS2安裝完後於 MinGW 執行以下指令，安裝 Mingw-w64 時，-y 可跳過詢問輸入 [Y/n] 的步驟pacman -Sy -y mingw-w64-x86_64-gcc

2/14/2023
WSL 攻略

參考微軟官方文件 WSL 文件 | Microsoft Learn [toc] 啟用 windows 功能 按下 +R 後在執行視窗輸入 Optionalfeatures 再按 確認 或 Enter ↲ 勾選 Windows 子系統 Linux 版 後按下 確認

10/6/2022
[<i class="fa fa-fw fa-book"></i>HTML 學習日誌](/OtASrN3MRrCeC72-usjO9Q?view)

國立中興大學1111學期資管系/學士班選修課 HTML5 WEB APP程式設計(1093)

10/5/2022
Read more from VJ
Published on HackMD