JavaScript usual funtion on NextUI Lab 1. window.location.href this JS change top browser https address window.location.href = "www.google.com.tw" icewindful useMemo const DropGameList = React.useMemo(() => { return(

Type script note, clean code methods. 1. Type Aliases :::info :::success type Point = { x: number;

install nextjs UI SETP install nextjsUI :::info npm i @nextui-org/react framer-motion ::: add tailwind.config.js setting :::info

extends ubuntu GUI disk tools resize Gui tools :::warning if can't resize it , please umount will resize partion disk example commands $ umount /dev/sda3 :::

★★★★★ Build NextJS TSX base folder and file use IMAGE 1. base folder pages (filefolder) :::info mkdir pages cd pages touch index.tsx add text in index.tsx :::success

★★★★★ How to make NextJs & Typescript getStart 1. insatll typescript :::info yarn global add typescript ::: install tsconfig.json :::info

How to make Next.js New Start 1. React Next.js install environment create folder :::info mkdir learn_next_js cd learn_next_js ::: install environment

install (NVM) React Nextjs install ubuntu set environment Commands install nvm (Node Version Manager) 1. install nvm :::success curl -o- https://raw.githubusercontent.com/nvm-sh/nvm/v0.34.0/install.sh | bash ::: :::danger

ubuntu 22.04 install GitKraken (git GUI) 1. get gitkraken :::info wget https://release.axocdn.com/linux/gitkraken-amd64.deb ::: 2. install gitkraken :::info sudo dpkg -i gitkraken-amd64.deb

https://code.visualstudio.com/download download .deb file move to Download file folder file * name = download file Name sudo dpkg -i *.deb install PyQt5

#include <bits/stdc++.h> #include <iostream> #include <vector> #include <unordered_map> using std::vector; using std::unordered_map; using namespace std; class BaseVectorPrint { public:

Memoization methods class Solution { public: int dp[1000 + 1][1000 + 1]; int maxLen(string& s1, string& s2, int n, int m) { if (n == 0 || m == 0) return 0;

You are climbing a staircase. It takes n steps to reach the top. Each time you can either climb 1 or 2 steps. In how many distinct ways can you climb to the top? Example 1: Input: n = 2 Output: 2 Explanation: There are two ways to climb to the top.

> DFS method /** * Definition for a binary tree node. * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode() : val(0), left(nullptr), right(nullptr) {} * TreeNode(int x) : val(x), left(nullptr), right(nullptr) {} * TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}

#include <bits/stdc++.h> #include <iostream> #include <vector> #include <unordered_map> using std::vector; using std::unordered_map; using namespace std; class BaseVectorPrint { public:

#include <bits/stdc++.h> #include <iostream> #include <vector> #include <unordered_map> #include <bitset> using std::vector; using std::unordered_map; using namespace std; class BaseVectorPrint {

#include <bits/stdc++.h> #include <iostream> #include <vector> #include <unordered_map> using std::vector; using std::unordered_map; using namespace std; class BaseVectorPrint { public:

#include <bits/stdc++.h> #include <iostream> #include <vector> #include <unordered_map> using std::vector; using std::unordered_map; using namespace std; class BaseVectorPrint { public:

DFS normal method /** * Definition for a binary tree node. * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode() : val(0), left(nullptr), right(nullptr) {} * TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}

Vscode be run code #include <bits/stdc++.h> #include <iostream> #include <vector> #include <unordered_map> using std::vector; //using std::unordered_map; using std::unordered_set; using namespace std;