N-Queens II - Swift Solution @ LeetCode
N-Queens II, is a LeetCode problem from graphs subdomain. In this post we will see how we can solve this challenge in Swift
Problem Description
You can find the full details of the problem N-Queens II at LeetCode
Solution
diagnol for each time, only need to care which column is used
Time Complexity: O(n^n), Space Complexity: O(n)
Please check the main.swift snippet for the solution.
This solution originally posted at: Github by @soapyigu
Comments
Leave a comment
You are not LoggedIn but you can comment as an anonymous user which requires manual approval. For better experience please Login.