diff options
| author | crupest <crupest@outlook.com> | 2021-09-26 12:50:45 +0800 | 
|---|---|---|
| committer | crupest <crupest@outlook.com> | 2021-09-26 12:50:45 +0800 | 
| commit | 1f9626144c4856d0a7d93b125175879d5a6685d4 (patch) | |
| tree | 9dead909b644b68598396ff78490c11a067f5e07 /works/solutions/leetcode/week/260/1.cpp | |
| parent | 8eb02362780883d16acc31c51225f6e9196405f2 (diff) | |
| download | crupest-1f9626144c4856d0a7d93b125175879d5a6685d4.tar.gz crupest-1f9626144c4856d0a7d93b125175879d5a6685d4.tar.bz2 crupest-1f9626144c4856d0a7d93b125175879d5a6685d4.zip | |
import(solutions): ...
Diffstat (limited to 'works/solutions/leetcode/week/260/1.cpp')
| -rw-r--r-- | works/solutions/leetcode/week/260/1.cpp | 21 | 
1 files changed, 21 insertions, 0 deletions
| diff --git a/works/solutions/leetcode/week/260/1.cpp b/works/solutions/leetcode/week/260/1.cpp new file mode 100644 index 0000000..4d6c78d --- /dev/null +++ b/works/solutions/leetcode/week/260/1.cpp @@ -0,0 +1,21 @@ +#include <vector> + +using std::vector; + +class Solution { +public: +    int maximumDifference(vector<int>& nums) { +        int result = -1; + +        for (int i = 1; i < nums.size(); i++) { +          for (int j = 0; j < i; j++) { +            int diff = nums[i] - nums[j]; +            if (diff > result) { +              result = diff; +            } +          } +        } + +        return result == 0 ? -1 : result; +    } +};
\ No newline at end of file | 
