1514. Path with Maximum Probability
⭐️⭐️⭐️ # 題目敘述 You are given an undirected weighted graph of n nodes (0-indexed), represented by an edge list where edges[i] = [a, b] is an undirected edge connecting the nodes a and b with a probability of success of traversing that edge succProb[i] . Given two nodes start and end , find the path...
more...373. Find K Pairs with Smallest Sums
⭐️⭐️⭐️ # 題目敘述 You are given two integer arrays nums1 and nums2 sorted in ascending order and an integer k . Define a pair (u, v) which consists of one element from the first array and one element from the second array. Return the k pairs (u1, v1), (u2, v2), ..., (uk, vk) with the smallest sums. #...
more...2462. Total Cost to Hire K Workers
⭐️⭐️⭐️ # 題目敘述 You are given a 0-indexed integer array costs where costs[i] is the cost of hiring the ith worker. You are also given two integers k and candidates . We want to hire exactly k workers according to the following rules: You will run k sessions and hire exactly one worker in each...
more...956. Tallest Billboard
⭐️⭐️⭐️⭐️⭐️ # 題目敘述 You are installing a billboard and want it to have the largest height. The billboard will have two steel supports, one on each side. Each steel support must be an equal height. You are given a collection of rods that can be welded together. For example, if you have rods of lengths...
more...1027. Longest Arithmetic Subsequence
⭐️⭐️⭐️ # 題目敘述 Given an array nums of integers, return the length of the longest arithmetic subsequence in nums . Note that: A subsequence is an array that can be derived from another array by deleting some or no elements without changing the order of the remaining elements. A sequence seq is...
more...714. Best Time to Buy and Sell Stock with Transaction Fee
⭐️⭐️⭐️ # 題目敘述 You are given an array prices where prices[i] is the price of a given stock on the ith day, and an integer fee representing a transaction fee. Find the maximum profit you can achieve. You may complete as many transactions as you like, but you need to pay the transaction fee for each...
more...2448. Minimum Cost to Make Array Equal
⭐️⭐️⭐️⭐️⭐️ # 題目敘述 You are given two 0-indexed arrays nums and cost consisting each of n positive integers. You can do the following operation any number of times: Increase or decrease any element of the array nums by 1 . The cost of doing one operation on the ith element is cost[i] . Return the...
more...What is CI/CD?
從測試、建置到部署一次自動化 # What is CI/CD? CI/CD 工具也是為了 DevOps 概念而產生的自動化工具,透過持續整合、持續部署的方式,在開發階段就自動協助開發人員偵測程式碼問題,並部署至伺服器。 # CI(Continuous Integration)持續整合 當開發人員完成一個階段性的程式碼後就經由自動化工具測試、驗證,協助偵測程式碼問題,並建置出即將部署的版本(Build)。 # CD(Continuous Deployment)持續部署 可以說是 CI 的下一階段,經過 CI 測試後所構建的程式碼可以透過 CD 工具部署至伺服器,減少人工部署的時間。 #...
more...What is DevOps?
ChienI Kao 筆記網站 JHTNT 筆記網站 # What is DevOps? DevOps 拆開來就是 Development + Operations ,也就是開發與維運。 更準確的說可以是「開發」「測試」「維運」三者的結合,是一種軟體開發和部署的方法論。 DevOps 主要促進開發和 IT 運營兩個團隊的結合與運作,提升團隊之間的協作和溝通。 DevOps...
more...


