[leetcode]1306. 跳躍遊戲 III

DFS解法java class Solution { vector<bool>visited; vector<int>arr; int len; public: bool DFS(int pos) { if(arr[pos] == 0) { return true; }

>>阅读原文<<