Skip to content

Conversation

moonjs0113
Copy link

Permutation

Description

This is permutation implementation in Swift.

Feature

  • It can determine the length of the permutation.
  • Returns nil if the count is out of valid range.

Code

func permutations<T>(data: [T], count: Int) -> [[T]]? {
    guard data.count >= count && count >= 0 else { return nil }
    var result: [[T]] = []
    var buffer: [T] = []
    var visited = Array(repeating: false, count: data.count)

    func nextElement() {
        if buffer.count == count {
            result.append(buffer)
            return
        }
        for i in 0..<data.count {
            if !visited[i] {
                visited[i] = true
                buffer.append(data[i])
                nextElement()
                buffer.removeLast()
                visited[i] = false
            }
        }
    }
    nextElement()
    return result
}

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

Successfully merging this pull request may close these issues.

1 participant