目前分類:LeetCode (17)
- Sep 01 Tue 2020 11:52
[ LeetCode ] [ Kotlin ] - 204. Count Primes 難度 ★ (Kotlin速度第一名 )
- Aug 19 Wed 2020 15:28
[ LeetCode ] [ Kotlin ] - 202. Happy Number 難度 ★ (Kotlin速度第一名 )
- Aug 18 Tue 2020 18:18
[ LeetCode ] [ Kotlin ] - 435. Non-overlapping Intervals 難度 ★★
- Jun 15 Mon 2020 14:42
[ LeetCode ] [ JavaScript ] - 1309. Decrypt String from Alphabet to Integer Mapping 難度 ★★
- Jun 14 Sun 2020 23:11
[ LeetCode ] [ JavaScript ] - 1342. Number of Steps to Reduce a Number to Zero 難度 ★
- Jun 13 Sat 2020 18:32
[ LeetCode ] [ JavaScript ] - 1408. String Matching in an Array 難度 ★
- Jun 12 Fri 2020 15:53
[ LeetCode ] [ JavaScript ] - 27. Remove Element 難度 ★
- Jun 12 Fri 2020 15:14
[ LeetCode ] [ JavaScript ] - 26. Remove Duplicates from Sorted Array 難度 ★
- Oct 11 Wed 2017 11:59
[ LeetCode ] [ JavaScript ] - 121. Best Time to Buy and Sell Stock (最佳低買高賣收益) 難度:★
官網題目敘述:
Say you have an array for which the ith element is the price of a given stock on day i.
- Oct 03 Tue 2017 12:06
[ LeetCode ] [ JavaScript ] - 113. Path Sum II (列出所有長度路徑) 難度:★★
官網題目敘述:
Given a binary tree and a sum, find all root-to-leaf paths where each path's sum equals the given sum.
- Jul 10 Mon 2017 11:12
[ LeetCode ] [ JavaScript ] - 112. Path Sum (看看是否有指定長度路徑) 難度:★
官網題目敘述:
Given a binary tree and a sum, determine if the tree has a root-to-leaf path such that adding up all the values along the path equals the given sum.
- Apr 21 Fri 2017 11:27
[ LeetCode ] [ JavaScript ] - 104. Maximum Depth of Binary Tree (查詢樹的深度) 難度:★
官網題目敘述:
- Total Accepted: 229958
- Total Submissions: 444624
- Difficulty: Easy
- Contributor: LeetCode
- Apr 13 Thu 2017 10:02
[ LeetCode ] [ JavaScript ] - 103. Binary Tree Zigzag Level Order Traversal (印出樹的階層二維陣列然後交錯排序)
官網題目敘述:
Given a binary tree, return the zigzag level order traversal of its nodes' values. (ie, from left to right, then right to left for the next level and alternate between).
- Apr 10 Mon 2017 10:17
[ LeetCode ] [ JavaScript ] - 102. Binary Tree Level Order Traversal (印出樹的階層二維陣列)
官網題目敘述:
Given a binary tree, return the level order traversal of its nodes' values. (ie, from left to right, level by level).
- Apr 05 Wed 2017 10:30
[ LeetCode ] [ JavaScript ] - 101. Symmetric Tree (檢查對稱樹)
題目敘述
Given a binary tree, check whether it is a mirror of itself (ie, symmetric around its center).
- Feb 24 Fri 2017 11:47
[ Leetcode ] [ javascript ] - 93. Restore IP Addresses
題目網址:https://leetcode.com/problems/restore-ip-addresses/?tab=Description
題目的意思是就是給你一串String 問你可能有哪幾種IP組合。
- Jan 16 Mon 2017 17:08
[ LeetCode ] [ JavaScript ] - 69. Sqrt(x) 實作尋找最接近無條件捨去的平方根整數。