remove trailing spaces

Author: rustykitty

0009-palindrome-number.cpp

@@ -12,7 +12,7 @@ class Solution {
     bool isPalindrome(int x) {
         if (x < 0) return false;
         // Reverse digits
-        long y = 0; // we have to use a long because some inputs 
+        long y = 0; // we have to use a long because some inputs
         int x2 = x; // exceed 2^31-1 when reversed
         while (x2 != 0) {
             y *= 10;

0020-valid-parentheses.cpp

@@ -25,6 +25,6 @@ class Solution {
                 stack.pop_back();
             }
         }
-        return stack.empty(); 
+        return stack.empty();
     }
 };

0173-binary-search-tree-iterator.cpp

@@ -33,11 +33,11 @@ class BSTIterator {
         traverse(root);
         pos = arr.cbegin();
     }
-    
+
     int next() {
         return *pos++;
     }
-    
+
     bool hasNext() {
         return pos != arr.cend();
     }

0278-first-bad-version.cpp

@@ -15,7 +15,7 @@ Memory: 7.58 MB (beats 62.02%)
 class Solution {
 public:
     int firstBadVersion(int n) {
-        
+
         while (isBadVersion(n)) n--; // go back by one until last good ver
         return n + 1; // ver after last good ver is first bad one
     }

1845-seat-reservation-manager.cpp

@@ -24,7 +24,7 @@ class SeatManager {
         seats.pop();
         return seatNumber;
     }
-    
+
     void unreserve(int seatNumber) {
         // seat is now available
         seats.push(seatNumber);

2095-delete-the-middle-node-of-a-linked-list.cpp

@@ -23,7 +23,7 @@ class Solution {
         if (head->next == nullptr) {
             return nullptr;
         }
-        ListNode *slower = head; 
+        ListNode *slower = head;
         ListNode *fast = head->next->next;
         while (fast != nullptr && fast->next != nullptr) {
             slower = slower->next;

2558-take-gifts-from-the-richest-pile.cpp

@@ -10,7 +10,7 @@ Memory: 13.26 MB (beats 36.35%)
 class Solution {
 public:
     long long pickGifts(vector<int>& gifts, int k) {
-        priority_queue<int> pq = { gifts.begin(), gifts.end() }; 
+        priority_queue<int> pq = { gifts.begin(), gifts.end() };
         for (int i = 0; i < k; ++i) {
             int temp = pq.top();
             pq.pop();