[Swift] LeetCode Solution Summary | LeetCode解題彙總

LeetCode Solution Summary | LeetCode解題彙總序號[#] 題名[Title] 通過率[Acceptance] 難度[Difficulty] 1 兩數之和 | Two Su

ati pan can turn color con length empty leet Given a non-negative integer represented as a non-empty array of digits, plus one to the int

steps style n-2 遞歸 climb n-1 turn reac pan You are climbing a stair case. It takes n steps to reach to the top. Each time you can either

node getheight pre logs root ever right class bit 遞歸，註意結果的三重判斷 public boolean isBalanced(TreeNode root) { if (root==null) return

一個 quad adr == should store .com 理解 force 碎碎念: 最近終於開始刷middle的題了，對於我這個小渣渣確實有點難度，經常一兩個小時寫出一道題來。在開始寫的幾道題中，發現大神在discuss中用到回溯法(Backtracking)的概

比賽地址： https://leetcode-cn.com/contest/weekly-contest-106 922. 按奇偶排序陣列 II 922. Sort Array By Parity II 給定一個非負整數陣列 A， A 中一半整數是奇數，一半整數是偶數。對陣列進行排序，以

https://leetcode.com/problems/summary-ranges/ Given a sorted integer array without duplicates, return the summary of its ranges. Example 1: Inpu

題目描述 Given a sorted integer array without duplicates, return the summary of its ranges. Example 1: I

題目連結：https://leetcode.com/problems/is-subsequence/ Given a string s and a string t, check if s is subsequence of t. You may assume tha

NO.1 121.Best Time to Buy and Sell Stock 限定只能夠買賣一次。思路：因為只能買賣一次，因此我們用兩個變數，buy表示買入價格,profit表示賣出後所賺的差價，buy不斷取陣列中元素的最小值，而profit我們取初始化時profit=0和p

1. 非原地的解答，通過四周補0可以很自然的按照規則寫出下一代的狀態 Game of Life According to the Wikipedia's article: "The Game of Life, also known simply as Life, is

【題目】 Given an array with n objects colored red, white or blue, sort them so that objects of the same color are adjacent, with the colors

【題目】 Given n pairs of parentheses, write a function to generate all combinations of well-formed parentheses. For example, given n = 3, a

題目描述： Given an array nums of n integers, are there elements a, b, c in nums such that a + b + c = 0? Find all unique triplets in

【題目】 Given two numbers represented as strings, return multiplication of the numbers as a string. Note: The numbers can be arbitrarily

【題目】 Given an array S of n integers, find three integers in S such that the sum is closest to a given number, target. Return the sum of

LeetCode 413. Arithmetic Slices 解題報告題目描述 A sequence of number is called arithmetic if it consists of at least three elements and

【題目】 Clone an undirected graph. Each node in the graph contains a label and a list of its neighbors. OJ's undirected graph serializat

題目如下： The gray code is a binary numeral system where two successive values differ in only one bit. Given a non-negative integer n repres

前言這道題目我今年面試的時候考過，不給出具體的哪家公司了，也是給定矩陣從左上角到右下角的和最小的路徑。開始我並不知道是確定了起始點和結束點，因此我第一反應是用DFS遍歷矩陣，然後那個面試官說不讓我用遞迴（其實dfs也不一定非用遞迴實現）。想了一下我說用動態規劃，給他寫

**LeetCode Solution Summary | LeetCode解題彙總**
序號[#]	題名[Title]	通過率[Acceptance]	難度[Difficulty]
1	兩數之和 \| Two Sum	39.1%	Easy
2	兩數相加 \| Add Two Numbers	29.4%	Medium
3	無重複字元的最長子串 \| Longest Substring Without Repeating Characters	25.2%	Medium
4	兩個排序陣列的中位數 \| Median of Two Sorted Arrays	24.2%	Hard
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100