Skip to content

Instantly share code, notes, and snippets.

@NigelJu
NigelJu / LeetCode 392. Is Subsequence ( swift ) .swift
Created July 9, 2018 15:20
LeetCode 392. Is Subsequence ( swift ) .swift
class Solution {
func isSubsequence(_ s: String, _ t: String) -> Bool {
if s.count == t.count { return s == t }
if s.count > t.count { return false }
if s.count == 0 { return true }
let tArray = Array(t)
let sArray = Array(s)
var sIndex = 0
var tIndex = 0
@NigelJu
NigelJu / LeetCode 392. Is Subsequence ( swift ) Base .swift
Created July 9, 2018 15:16
LeetCode 392. Is Subsequence ( swift ) Base .swift
class Solution {
func isSubsequence(_ s: String, _ t: String) -> Bool {
if s.count == t.count { return s == t }
if s.count > t.count { return false }
if s.count == 0 { return true }
var tArray = Array(t)
var sArray = Array(s)
var sIndex = 0
var tIndex = 0
@NigelJu
NigelJu / MyView.swift
Created July 8, 2018 09:14
MyView.swift
//
// MyView.swift
// TestXib
//
// Created by Nigel on 2018/7/8.
// Copyright © 2018年 Nigel. All rights reserved.
//
import UIKit
@NigelJu
NigelJu / LeetCode 383. Ransom Note (swift) Loop.swift
Created July 8, 2018 05:28
LeetCode 383. Ransom Note (swift) Loop.swift
class Solution {
func canConstruct(_ ransomNote: String, _ magazine: String) -> Bool {
if ransomNote.count == magazine.count { return ransomNote == magazine }
if ransomNote.count > magazine.count { return false }
if ransomNote.count == 0 { return true }
var mapping = [Character: Int]()
for char in ransomNote {
@NigelJu
NigelJu / LeetCode 383. Ransom Note (swift).swift
Created July 8, 2018 05:24
LeetCode 383. Ransom Note (swift).swift
class Solution {
func canConstruct(_ ransomNote: String, _ magazine: String) -> Bool {
if ransomNote.count == magazine.count { return ransomNote == magazine }
if ransomNote.count > magazine.count { return false }
if ransomNote.count == 0 { return true }
var mapping = [Character: Int]()
for char in ransomNote {
@NigelJu
NigelJu / LeetCode 136. Single Number XOR .swift
Created July 7, 2018 02:48
LeetCode 136. Single Number XOR.swift
class Solution {
func singleNumber(_ nums: [Int]) -> Int {
return nums.reduce(0, ^)
}
}
@NigelJu
NigelJu / LeetCode 136. Single Number.swift
Created July 7, 2018 01:52
LeetCode 136. Single Number.swift
class Solution {
func singleNumber(_ nums: [Int]) -> Int {
var mapping = [Int: Bool]()
for num in nums {
if let _ = mapping[num] {
mapping[num] = true
}else {
mapping.updateValue(false, forKey: num)
@NigelJu
NigelJu / LeetCode 404. Sum of Left Leaves ( swift ) edit.swift
Created July 7, 2018 00:56
LeetCode 404. Sum of Left Leaves ( swift ) edit.swift
class Solution {
func sumOfLeftLeaves(_ root: TreeNode?) -> Int {
return dfs(root: root, isLeft: false)
}
func dfs(root: TreeNode?, isLeft: Bool) -> Int {
guard let root = root else { return 0 }
@NigelJu
NigelJu / LeetCode 404. Sum of Left Leaves ( swift ).swift
Created July 7, 2018 00:15
LeetCode 404. Sum of Left Leaves ( swift ).swift
class Solution {
func sumOfLeftLeaves(_ root: TreeNode?) -> Int {
return dfs(root: root, isLeft: false)
}
func dfs(root: TreeNode?, isLeft: Bool) -> Int {
guard let root = root else { return 0 }
var result = 0
@NigelJu
NigelJu / LeetCode 434. Number of Segments in a String ( using Swift).swift
Created July 5, 2018 14:03
LeetCode 434. Number of Segments in a String ( using Swift)
class Solution {
func countSegments(_ s: String) -> Int {
return Array(s).split(separator: " ").count
}
}