plantpurecode

@interface JRMutableDictionary : NSMutableDictionary
@end

@implementation JRMutableDictionary {
    dispatch_queue_t queue;
    NSMutableDictionary *storage;
}

- (void)dealloc {
    if(queue) {

plantpurecode

let array = ["a", "b", "c", "d"].map(Optional.init)
array.contains("a") // true
array.contains(Optional("a")) // true
array.contains("e") // false
array.contains(Optional("e")) // false

let otherArray = ["a"]

// `Array.first` is an Optional property, but we can use it as an argument to `Array.contains` since the array is actually of Optional<String> type...
array.contains(otherArray.first) // true

plantpurecode

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     public var val: Int
 *     public var left: TreeNode?
 *     public var right: TreeNode?
 *     public init() { self.val = 0; self.left = nil; self.right = nil; }
 *     public init(_ val: Int) { self.val = val; self.left = nil; self.right = nil; }
 *     public init(_ val: Int, _ left: TreeNode?, _ right: TreeNode?) {
 *         self.val = val

plantpurecode

public class TreeNode {
  public var val: Int
  public var left: TreeNode?
  public var right: TreeNode?
  public init() { self.val = 0; self.left = nil; self.right = nil; }
  public init(_ val: Int) { self.val = val; self.left = nil; self.right = nil; }
  public init(_ val: Int, _ left: TreeNode?, _ right: TreeNode?) {
    self.val = val
    self.left = left
    self.right = right

plantpurecode

//
//  itoa.c
//  itoa
//
//  Created by Jacob Relkin on 14/02/2021.
//

#include <stdlib.h>
#include <stdio.h>
#include <math.h>