| class Solution { | |
| let vowels: Set<Character> = ["a", "e", "i", "o", "u", "A", "E", "I", "O", "U"] | |
| func reverseVowels(_ s: String) -> String { | |
| var foundIndices: [String.Index] = [] | |
| var ans = s | |
| for i in s.indices { | |
| if vowels.contains(s[i]) { | |
| foundIndices.append(i) | |
| } | |
| } |
| /* | |
| You have a long flowerbed in which some of the plots are planted, and some are not. However, flowers cannot be planted in adjacent plots. | |
| Given an integer array flowerbed containing 0's and 1's, where 0 means empty and 1 means not empty, and an integer n, return true if n new flowers can be planted in the flowerbed without violating the no-adjacent-flowers rule and false otherwise. | |
| Example 1: | |
| Input: flowerbed = [1,0,0,0,1], n = 1 | |
| Output: true |
| class Solution { | |
| func gcdOfStrings(_ str1: String, _ str2: String) -> String { | |
| if str2.count > str1.count { | |
| return findGCDOf(str1: str2, str2: str1) | |
| } else { | |
| return findGCDOf(str1: str2, str2: str1) | |
| } | |
| } | |
| func findGCDOf(str1: String, str2: String) -> String { |
This happened after it successfully built, but didn't launch.
Simulator device failed to install the application.
Domain: IXErrorDomain
Code: 2
Failure Reason: Invalid placeholder attributes.
User Info: {
DVTErrorCreationDateKey = "2025-04-06 19:35:47 +0000";
FunctionName = "+[IXPlaceholder _placeholderForBundle:client:withParent:installType:metadata:placeholderType:mayBeDeltaPackage:isFromSerializedPlaceholder:error:]";
| extension Character: Strideable { | |
| public func distance(to other: Character) -> Int { | |
| let selfValue = self.unicodeScalars.first?.value ?? 0 | |
| let otherValue = other.unicodeScalars.first?.value ?? 0 | |
| return Int(otherValue - selfValue) | |
| } | |
| public func advanced(by n: Int) -> Character { | |
| guard let scalar = self.unicodeScalars.first else { | |
| fatalError("Cannot advance an empty character") |
var a: some Equatable = 10
var c: some Equatable = 10
a = c // ERROR: Cannot assign value of type 'some Equatable' (type of 'c') to type 'some Equatable' (type of 'a')You can't pass a different some Equatable to a. The compiler can't guarantee if a and c have identical underlying concrete types. Even though on the screen you can see c is an Int, to the compiler it's just some Equatable. It's NOT some Equatable_But_really_an_Int.
Because it's some Equatable then the compiler would be like, then 'What if c was "ten"? Let's just be safe an not allow it'
| /// start from m * n. Use RECURSION. End at 0 * 0 | |
| /// out of bounds could be the top and left edges. | |
| func lcs(_ t1: [Character], _ t2: [Character]) -> Int { | |
| var cache: [Stage: Int] = [:] | |
| func helper(_ s: Stage) -> Int { | |
| if let cached = cache[s] { | |
| return cached | |
| } | |
| func lcs(_ t1: [Character], _ t2: [Character]) -> Int { | |
| // 1. build and default grid to 0 | |
| let row = Array(repeating: 0, count: t2.count) | |
| var grid = Array(repeating: row, count: t1.count) | |
| func lcs(_ s: Stage) -> Int { | |
| // 3. Exit with a 0 for any point that's beyond the left or bottom edges | |
| guard s.s1 >= 0 && s.s2 >= 0 else { | |
| return 0 | |
| } |
| // Code inside modules can be shared between pages and other source files. | |
| public class BinaryNode { | |
| public var val: Int | |
| public var left: BinaryNode? | |
| public var right: BinaryNode? | |
| public init() { self.val = 0 | |
| self.left = nil | |
| self.right = nil | |
| } |