原创 [LeetCode]Minimum Cost Tree From Leaf Values@Golang

Minimum Cost Tree From Leaf Values Given an array arr of positive integers, consider all binary trees such that: Ea

原创 [LeetCode]Maximum Subarray Sum with One Deletion@Golang

Maximum Subarray Sum with One Deletion Given an array of integers, return the maximum sum for a non-empty subarray

原创 [LeetCode]Longest Arithmetic Sequence@Golang

Longest Arithmetic Sequence Given an array A of integers, return the length of the longest arithmetic subsequence i

原创 [LeetCode]Largest 1-Bordered Square@Golang

Largest 1-Bordered Square Given a 2D grid of 0s and 1s, return the number of elements in the largest square subgrid

原创 [LeetCode]Last Stone Weight II@Golang

Last Stone Weight II We have a collection of rocks, each rock has a positive integer weight. Each turn, we choose a

原创 [LeetCode]Longest Common Subsequence@Golang

Longest Common Subsequence Given two strings text1 and text2, return the length of their longest common subsequence

原创 [LeetCode]Stone Game II@Golang

Stone Game II Alex and Lee continue their games with piles of stones. There are a number of piles arranged in a ro

原创 [LeetCode]Length of Longest Fibonacci Subsequence@Golang

Length of Longest Fibonacci Subsequence A sequence X_1, X_2, …, X_n is fibonacci-like if: n >= 3 X_i + X_{i+1} = X_

原创 [LeetCode]Filling Bookcase Shelves@Golang

Filling Bookcase Shelves We have a sequence of books: the i-th book has thickness books[i][0] and height books[i][1

原创 [LeetCode]Longest String Chain@Golang

Longest String Chain Given a list of words, each word consists of English lowercase letters. Let’s say word1 is a p

原创 [LeetCode]Push Dominoes@Golang

Push Dominoes There are N dominoes in a line, and we place each domino vertically upright. In the beginning, we sim

原创 計算機組成原理

文章目錄計算機的基本硬件組成計算機性能提升性能計算機指令CPU執行指令棧溢出編譯、鏈接和裝載編碼電路浮點數處理器指令+運算=CPU指令流水線加速矩陣乘法異常處理處理器綜合計算機存儲與IO 計算機的基本硬件組成 三大基本部分:CP

原创 [LeetCode]Bitwise ORs of Subarrays@Golang

Bitwise ORs of Subarrays We have an array A of non-negative integers. For every (contiguous) subarray B = [A[i], A[

原创 [LeetCode]Minimum Cost For Tickets@Golang

Minimum Cost For Tickets In a country popular for train travel, you have planned some train travelling one year in

原创 [LeetCode]Video Stitching@Golang

Video Stitching You are given a series of video clips from a sporting event that lasted T seconds. These video cli