Given an integer array nums, return an array answer such that answer[i] is equal to the product of all the elements of nums except nums[i].
The product of any prefix or suffix of nums is guaranteed to fit in a 32-bit integer.
You must write an algorithm that runs in O(n) time and without using the division operation.
[LeetCode] 0238. Product of Array Except Self 阅读更多 ”
Leetcode, 技术文章
[LeetCode] 0219. Contains Duplicate II.
Given an integer array nums and an integer k, return true if there are two distinct indices i and j in the array such that nums[i] == nums[j] and abs(i – j) <= k
[LeetCode] 0219. Contains Duplicate II 阅读更多 ”
Leetcode, 技术文章
[LeetCode] 0217. Contains Duplicate.
Easy
Given an integer array nums, return true if any value appears at least twice in the array, and return false if every element is distinct.
[LeetCode] 0217. Contains Duplicate 阅读更多 ”
Leetcode, 技术文章
[LeetCode] 0123. Best Time to Buy and Sell Stock III.
Hard
You are given an array prices where prices[i] is the price of a given stock on the ith day.
Find the maximum profit you can achieve. You may complete at most two transactions.
Note: You may not engage in multiple transactions simultaneously (ie, you must sell the stock before you buy again).
[LeetCode] 0123. Best Time to Buy and Sell Stock III 阅读更多 ”
Leetcode, 技术文章
[LeetCode] 0122. Best Time to Buy and Sell Stock II.
You are given an integer array prices where prices[i] is the price of a given stock on the ith day.
On each day, you may decide to buy and/or sell the stock. You can only hold at most one share of the stock at any time. However, you can buy it then immediately sell it on the same day.
Find and return the maximum profit you can achieve.
[LeetCode] 0122. Best Time to Buy and Sell Stock II 阅读更多 ”
Leetcode, 技术文章
[LeetCode] 0121. Best Time to Buy and Sell Stock
Easy
You are given an array prices where prices[i] is the price of a given stock on the ith day.
You want to maximize your profit by choosing a single day to buy one stock and choosing a different day in the future to sell that stock.
Return the maximum profit you can achieve from this transaction. If you cannot achieve any profit, return 0.
[LeetCode] 0121. Best Time to Buy and Sell Stock 阅读更多 ”
Leetcode, 技术文章
[LeetCode] 1. Two Sum. Given an array of integers nums and an integer target, return indices of the two numbers such that they add up to target.
You may assume that each input would have exactly one solution, and you may not use the same element twice. You can return the answer in any order.
在这个数位化时代，程式设计已经成为现代人需要掌握的基本技能之一。不仅限于在科技业，越来越多的产业开始期待员工都能具备基本的程式设计素养。
程式设计无论在提升职场竞争力、解决复杂问题，还是开发创新的应用，都是非常强的助力，不只是对公司的产品开发，对个人生涯发展也是如此。
为什么要学写程式？职涯发展、解决问题能力等3 大优势一次看！ 阅读更多 ”
技术文章, 软体工程师
做AI 题目的新创如雨后春笋，除了前几篇介绍的LLM Cluade 母公司Anthropic, 做数据处理的Scale AI, 做MarTech 的台湾独角兽Appier, 没想到AI 也可以结合搜寻引擎，快速突破全球千万使用者，逐渐威胁到Google 的领导地位！
Perplexity 在这个艰难的赛道中脱颖而出，目前已筹集高达7400 万美元的融资，成为辉达（Nvidia）、Amazon 创办人Jeff Bezos 等科技业代表性公司和人物的投资对象！ Perplexity AI 到底是怎样的公司？与Google 的差别是什么？会怎样颠覆搜寻的未来？
Perplexity AI ：估值超过10亿美元，黄仁勋也爱用的AI 工具！自诩为「答案」引擎，如何用AI 挑战Google Search 的地位？ 阅读更多 ”
技术文章, 科技新创专栏
CDN 是一组根据地理位置去做置放的代理伺服器（Proxy Server）。其中，代理伺服器是客户端和伺服器之间的中间伺服器，代理伺服器也会放置在网路边缘（Network Edge）。也因为网路边缘靠近最终用户，代理伺服器的放置有助于透过减少延迟和节省频宽来快速将对应的资料传送给使用者。 CDN 除了作为简单的代理伺服器之外还，也可以透过一些设定以及操作让他们变得更有效率。