move: Move file to correct directory

Author: WhiteHyun

best-time-to-buy-and-sell-stock/WhiteHyun.swift

@@ -1,15 +1,28 @@
 //
-//  217. Contains Duplicate.swift
-//  https://leetcode.com/problems/contains-duplicate/description/
+//  121. Best Time to Buy and Sell Stock.swift
+//  https://leetcode.com/problems/best-time-to-buy-and-sell-stock/description/
 //  Algorithm
 //
 //  Created by 홍승현 on 2024/04/26.
 //
 
 import Foundation
 
-final class LeetCode217 {
-  func containsDuplicate(_ nums: [Int]) -> Bool {
-    Set(nums).count != nums.count
+final class LeetCode121 {
+  func maxProfit(_ prices: [Int]) -> Int {
+    if prices.count == 1 { return 0 }
+    var diff = 0
+    var left = 0
+    var right = 0
+
+    while right < prices.endIndex {
+      if prices[left] > prices[right] {
+        left = right
+      } else {
+        diff = max(diff, prices[right] - prices[left])
+      }
+      right += 1
+    }
+    return diff
   }
 }

contains-duplicate/WhiteHyun.swift

@@ -1,28 +1,15 @@
 //
-//  121. Best Time to Buy and Sell Stock.swift
-//  https://leetcode.com/problems/best-time-to-buy-and-sell-stock/description/
+//  217. Contains Duplicate.swift
+//  https://leetcode.com/problems/contains-duplicate/description/
 //  Algorithm
 //
 //  Created by 홍승현 on 2024/04/26.
 //
 
 import Foundation
 
-final class LeetCode121 {
-  func maxProfit(_ prices: [Int]) -> Int {
-    if prices.count == 1 { return 0 }
-    var diff = 0
-    var left = 0
-    var right = 0
-
-    while right < prices.endIndex {
-      if prices[left] > prices[right] {
-        left = right
-      } else {
-        diff = max(diff, prices[right] - prices[left])
-      }
-      right += 1
-    }
-    return diff
+final class LeetCode217 {
+  func containsDuplicate(_ nums: [Int]) -> Bool {
+    Set(nums).count != nums.count
   }
 }