2018.8.18 贝壳找房取消社团预约 题解

Java版本的+1： https://paste.ubuntu.com/p/yZ8Kn8q3NY/

贴下一个java版本的。 package beike; import java.util.ArrayList; import java.util.Collection; import java.util.Collections; import java.util.Scanner; public class Main2 { public static void main(String[] args) { Scanner sc = new Scanner(System.in); int n = sc.nextInt(); ArrayList<Time> list = new ArrayList<>(); for(int i=0;i<n;i++){ int start = sc.nextInt(); int end = sc.nextInt(); list.add(new Time(i+1,start, end)); } Collections.sort(list); ArrayList<Integer> res = new ArrayList<>(); loop1: for(int i=0;i<n;i++){ for(int j=0;i<n;j++){ if(j==i) continue; int pre = j; int next = j+1; if(next == i){ next = i+1; } if(next == n){ break; } if(list.get(pre).end > list.get(next).start){ continue loop1; } } res.add(list.get(i).id); } Collections.sort(res); System.out.println(res.size()); for(int i=0;i<res.size();i++){ System.out.print(res.get(i)); if(i!=res.size()-1){ System.out.print(" "); } } System.out.println(); } } class Time implements Comparable<Time>{ public int id; public int start; public int end; public Time(int i,int s,int e){ this.id = i; this.start = s; this.end = e; } @Override public int compareTo(Time o) { return this.start - o.start; } }

贴一份自己的C++: #include <iostream> #include <string> #include <algorithm> #include <map> #include <vector> using namespace std; class use { public:     use(int start, int end,int index) { this->start = start; this->end = end; this->index = index;}     int start;     int end;     int index; }; bool compare(use &u1, use &u2) {     return u1.start < u2.start; } void solution() {     int n;     cin >> n;     vector<use> shetuan;     for (int i = 0; i < n; ++i)     {         int temp1, temp2;         cin >> temp1 >> temp2;         shetuan.emplace_back(use(temp1, temp2,i+1));     }     sort(shetuan.begin(), shetuan.end(), compare);     bool isFirst = true;     bool isCan = true;     vector<int> res;     int minTime, maxTime;     for (int i = 0; i < n; ++i)     {         for (int j = 0; j < n; ++j)         {             if (i != j)             {                 if (isFirst)                 {                     minTime = shetuan[j].start;                     maxTime = shetuan[j].end;                     isFirst = false;                 }                 else                 {                     if (shetuan[j].start < maxTime)                     {                         isCan = false;                         break;                     }                     maxTime = shetuan[j].end;                 }             }         }         if (isCan)             res.emplace_back(shetuan[i].index);         isFirst = true;         isCan = true;     }     if (res.size() == 0)         cout << 0;     else     {         cout << res.size()<<endl;         sort(res.begin(), res.end());         for (int i = 0; i < res.size(); ++i)         {             cout << res[i];             if (i != res.size() - 1)                 cout << " ";         }     } } int main() {    solution() ;  }

说实话我没看懂那个题。。。

做出前两题的都是大神啊

求一份c++的