[Swift]LeetCode455. 分發餅乾 | Assign Cookies

★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★
➤微信公衆號：山青詠芝（shanqingyongzhi）
➤博客園地址：山青詠芝（https://www.cnblogs.com/strengthen/）
➤GitHub地址：https://github.com/strengthen/LeetCode
➤原文地址：http://www.javashuo.com/article/p-cppxrgny-hq.html 
➤若是連接不是山青詠芝的博客園地址，則多是爬取做者的文章。
➤原文已修改更新！強烈建議點擊原文地址閱讀！支持做者！支持原創！
★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★

Assume you are an awesome parent and want to give your children some cookies. But, you should give each child at most one cookie. Each child i has a greed factor gi, which is the minimum size of a cookie that the child will be content with; and each cookie j has a size sj. If sj >= gi, we can assign the cookie j to the child i, and the child i will be content. Your goal is to maximize the number of your content children and output the maximum number.

Note:
You may assume the greed factor is always positive. 
You cannot assign more than one cookie to one child.

Example 1:

Input: [1,2,3], [1,1]

Output: 1

Explanation: You have 3 children and 2 cookies. The greed factors of 3 children are 1, 2, 3. 
And even though you have 2 cookies, since their size is both 1, you could only make the child whose greed factor is 1 content.
You need to output 1.

 

Example 2:

Input: [1,2], [1,2,3]

Output: 2

Explanation: You have 2 children and 3 cookies. The greed factors of 2 children are 1, 2. 
You have 3 cookies and their sizes are big enough to gratify all of the children, 
You need to output 2.

---

假設你是一位很棒的家長，想要給你的孩子們一些小餅乾。可是，每一個孩子最多隻能給一塊餅乾。對每一個孩子 i ，都有一個胃口值 gi ，這是能讓孩子們知足胃口的餅乾的最小尺寸；而且每塊餅乾 j ，都有一個尺寸 sj 。若是 sj >= gi ，咱們能夠將這個餅乾 j 分配給孩子 i ，這個孩子會獲得知足。你的目標是儘量知足越多數量的孩子，並輸出這個最大數值。

注意：

你能夠假設胃口值爲正。
一個小朋友最多隻能擁有一塊餅乾。

示例 1:

輸入: [1,2,3], [1,1]

輸出: 1

解釋: 
你有三個孩子和兩塊小餅乾，3個孩子的胃口值分別是：1,2,3。
雖然你有兩塊小餅乾，因爲他們的尺寸都是1，你只能讓胃口值是1的孩子知足。
因此你應該輸出1。

示例 2:

輸入: [1,2], [1,2,3]

輸出: 2

解釋: 
你有兩個孩子和三塊小餅乾，2個孩子的胃口值分別是1,2。
你擁有的餅乾數量和尺寸都足以讓全部孩子知足。
因此你應該輸出2.

---

64ms

 1 class Solution {
 2     func findContentChildren(_ g: [Int], _ s: [Int]) -> Int {
 3         //對數組進行排序
 4         var sortedS = s.sorted(by:<)
 5         var sortedG = g.sorted(by:<)
 6         var i=0, j=0
 7         while i < s.count && j < g.count {
 8             if sortedS[i] >= sortedG[j] {
 9                 j+=1
10             }
11             i+=1
12         }
13         return j
14     }
15 }

---

108ms

 1 class Solution {
 2     func findContentChildren(_ g: [Int], _ s: [Int]) -> Int {
 3         var count = 0
 4     var childs = g.sorted(by: >)
 5     var cookies = s.sorted(by: >)
 6     
 7     for i in 0..<childs.count {
 8         if let bc = cookies.first{
 9             if bc >= childs[i] {
10                 count += 1
11                 cookies.removeFirst()
12             }
13         }
14         
15     }
16     
17     return count
18     }
19 }

---

120ms

 1 class Solution {
 2     func findContentChildren(_ g: [Int], _ s: [Int]) -> Int {
 3         var sortedS = s.sorted()
 4         var sortedG = g.sorted()
 5         var count = 0
 6         var i=0, j=0
 7         while i < s.count && j < g.count {
 8             if sortedS[i] >= sortedG[j] {
 9                 j+=1
10             }
11             i+=1
12         }
13         return j
14     }
15 }