1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 | class Solution { public: int canCompleteCircuit(vector<int>& gas, vector<int>& cost) { int summ = 0; for(int i = 0; i < gas.size(); i++){ summ += gas[i]-cost[i]; } if(summ < 0) return -1; int current = 0; int start = 0; for(int i = 0; i < gas.size(); i++){ current += gas[i] - cost[i]; if(current < 0){ start = i+1; current = 0; } } return start; } }; | cs |
230107 데일리
꽃지(sanholobeats)
2023-01-07 16:08
추천 0
다른 게시글
-
134. Gas Station개발뉴비(coderhs) | 23.01.07추천 0
-
1833. Maximum Ice Cream Bars개발뉴비(coderhs) | 23.01.06추천 0
-
230106 데일리꽃지(sanholobeats) | 23.01.06추천 0
-
오늘의 릿코드 Minimum Number of Arrows~개발뉴비(coderhs) | 23.01.05추천 0
-
230105 데일리 [3]꽃지(sanholobeats) | 23.01.05추천 0
-
2244. Minimum Rounds 이거 푸는데TS(119.64) | 23.01.05추천 0
-
데일리 문제 어떻게 알아봄...? [1]TS(119.64) | 23.01.05추천 0
-
230104 데일리 [1]꽃지(sanholobeats) | 23.01.04추천 0
-
Minimum Rounds to Complete All Task개발뉴비(coderhs) | 23.01.04추천 0
-
944. Delete Columns to Make Sorted in TS익명(119.64) | 23.01.04추천 0
댓글 0