Leetcode #947: Most Stones Removed with Same Row or Column
func removeStones(_ stones: [[Int]]) -> Int { var xDict = [Int: [Int]]() var yDict = [Int: [In...
0
0
Comment0
322 search resultsShowing 1~20 results
Stocked
You need to log-in
Leetcode #753: Cracking the Safe
import Foundation class Solution { func crackSafe(_ n: Int, _ k: Int) -> String { var totalSiz...
0
0
Comment0
Leetcode #1165: Single-Row Keyboard
func calculateTime(_ keyboard: String, _ word: String) -> Int { var ar = Array(repeating: 0, c...
0
0
Comment0
Leetcode #1170: Compare Strings by Frequency of the Smallest Character
func numSmallerByFrequency(_ queries: [String], _ words: [String]) -> [Int] { var ar = Array(r...
1
0
Comment0
Leetcode #486: Predict the Winner
Solution 1: Recursion func PredictTheWinner(_ nums: [Int]) -> Bool { return winner(nums, 0, nu...
0
0
Comment0
Leetcode #833: Find And Replace in String
func findReplaceString(_ S: String, _ indexes: [Int], _ sources: [String], _ targets: [String]) -...
0
0
Comment0
Leetcode #173: Binary Search Tree Iterator
class BSTIterator { private var ar = [Int]() private var index = 0 init(_ root: TreeNode?) { ar =...
0
0
Comment0
Leetcode #900: RLE Iterator
class RLEIterator { private var ar = [Int]() private var num = [Int]() private var current = 0 pr...
0
0
Comment0
Leetcode #250: Count Univalue Subtrees
func countUnivalSubtrees(_ root: TreeNode?) -> Int { if root == nil { return 0 } if root?.left...
0
0
Comment0
Leetcode #636: Exclusive Time of Functions
func exclusiveTime(_ n: Int, _ logs: [String]) -> [Int] { var answer = Array(repeating: 0, cou...
0
0
Comment0
Leetcode #846: Hand of Straights
func isNStraightHand(_ hand: [Int], _ W: Int) -> Bool { if hand.count % W != 0 { return false ...
0
0
Comment0
Leetcode #328: Odd Even Linked List
func oddEvenList(_ head: ListNode?) -> ListNode? { let dummyNode = ListNode(0) dummyNode.next ...
0
0
Comment0
Leetcode #287: Find the Duplicate Number
Solution 1: Sorting func findDuplicate(_ nums: [Int]) -> Int { var nums = nums.sorted() for i ...
0
0
Comment0
Leetcode #156: Binary Tree Upside Down
Solution 1: Recursively func upsideDownBinaryTree(_ root: TreeNode?) -> TreeNode? { if root ==...
0
0
Comment0
Leetcode #981: Time Based Key-Value Store
class TimeMap { /** Initialize your data structure here. */ private var timestamps = [String: [In...
0
0
Comment0
Leetcode #714: Best Time to Buy and Sell Stock
func maxProfit(_ prices: [Int], _ fee: Int) -> Int { var cash = 0 var hold = -prices[0] for i ...
0
0
Comment0
Leetcode #1048: Longest String Chain
func longestStrChain(_ words: [String]) -> Int { let words = words.sorted { $0.count < $1.c...
0
0
Comment0
Leetcode #609: Find Duplicate File in System
func findDuplicate(_ paths: [String]) -> [[String]] { var dict = [String: [String]]() for path...
0
0
Comment0
Leetcode #529: Minesweeper
func updateBoard(_ board: [[Character]], _ click: [Int]) -> [[Character]] { var board = board ...
0
0
Comment0
Leetcode #1011: Capacity To Ship Packages Within D Days
func shipWithinDays(_ weights: [Int], _ D: Int) -> Int { var start = weights.max()! var end = ...
0
0
Comment0
322 search resultsShowing 1~20 results
Qiita is a knowledge sharing service for engineers.
- You can follow users and tags
- You can stock useful information
- You can make edit suggestions for articles