提交算法题

codeYMF · codeYMF · commit ee8bfeeea573 · 2019-05-25T22:08:32.000+08:00
提交5月算法题
diff --git a/高/5月-情侣牵手-杨梦飞.md b/高/5月-情侣牵手-杨梦飞.md
@@ -0,0 +1,45 @@
+##情侣牵手
+```
+class Solution {
+    func minSwapsCouples(_ row: [Int]) -> Int {
+        var items = row
+        var count: Int = 0
+        var index:Int = 0
+        
+        while index < row.count - 1 {
+            let firstItem = items[index]
+            let secondItem = items[index + 1]
+            
+            if firstItem % 2 == 0 { // 偶数
+                if secondItem != firstItem + 1 {  // 非情侣
+                    items = swapItems(items: items, item1: secondItem, item2: firstItem + 1)
+                    count += 1
+                }
+            } else {    // 奇数
+                if secondItem != firstItem - 1 { // 非情侣
+                    items = swapItems(items: items, item1: secondItem, item2: firstItem - 1)
+                    count += 1
+                }
+            }
+            
+            // 自增2
+            index = index + 2
+            
+        }
+        
+        
+        return count
+    }
+    
+    func swapItems(items:[Int], item1: Int, item2: Int) -> [Int] {
+        var newitem = items
+        let index1 = newitem.index(of: item1)
+        let index2 = newitem.index(of: item2)
+        newitem[index1!] = item2
+        newitem[index2!] = item1
+        
+        return newitem
+    }
+}
+
+```
diff --git a/高/5月-最长连续序列-杨梦飞.md b/高/5月-最长连续序列-杨梦飞.md
@@ -0,0 +1,36 @@
+##最长连续序列
+
+```
+class Solution {
+    func longestConsecutive(_ nums: [Int]) -> Int {
+
+         if nums.count == 0 {
+            return 0
+        }
+        
+        // 先从小到大排序
+        var newItems = nums.sorted { (num1, num2) -> Bool in
+            return num1 < num2
+        }
+
+        var longestCount = 1
+        var currenCount = 1
+        var i = 0
+        // 判断相邻的有序数列是否连续，并找出最大值
+        while(i < newItems.count - 1) {
+            if (newItems[i + 1]) != newItems[i] {
+                if newItems[i + 1] == newItems[i] + 1 {
+                    currenCount +=  1
+                } else {
+                    longestCount = max(longestCount, currenCount)
+                    currenCount = 1
+                }
+                
+            }
+            i += 1
+        }
+
+        return max(longestCount, currenCount)
+    }
+}
+```
