Skip to content

1658 solution #137

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
merged 4 commits into from
Nov 23, 2020
Merged

1658 solution #137

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
4 commits
Select commit Hold shift + click to select a range
17dde0d
Add solution for problem 1658 in javascript
ltp88 Nov 19, 2020
1e6f8c7
Add missing file
ltp88 Nov 19, 2020
3ea5490
Merge branch 'master' of github.com:ltp88/Leetcode-1 into js-1658-sol…
ltp88 Nov 23, 2020
112c6ff
Update README.md
ltp88 Nov 23, 2020
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
1 change: 1 addition & 0 deletions README.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -10,6 +10,7 @@ _If you like this project, please leave me a star._ ★
|-----|----------------|---------------|--------|-------------|-------------
|1663|[Smallest String With A Given Numeric Value](https://leetcode.com/problems/smallest-string-with-a-given-numeric-value/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1663.java) ||Medium|Greedy|
|1662|[Check If Two String Arrays are Equivalent](https://leetcode.com/problems/check-if-two-string-arrays-are-equivalent/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1662.java) ||Easy|String|
|1658|[Minimum Operations to Reduce X to Zero](https://leetcode.com/problems/minimum-operations-to-reduce-x-to-zero/)|[Javascript](./javascript/_1658.js)||Medium|Greedy|
|1657|[Determine if Two Strings Are Close](https://leetcode.com/problems/determine-if-two-strings-are-close/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1657.java) ||Medium|Greedy|
|1656|[Design an Ordered Stream](https://leetcode.com/problems/design-an-ordered-stream/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1656.java) ||Easy|Array, Design|
|1652|[Defuse the Bomb](https://leetcode.com/problems/defuse-the-bomb/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1652.java) ||Easy|Array|
Expand Down
25 changes: 25 additions & 0 deletions javascript/_1658.js
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,25 @@
// Author: Phuong Lam

/**
* @param {number[]} nums
* @param {number} x
* @return {number}
*/
var minOperations = function (nums, x) {
const total = nums.reduce((a, b) => a + b)
if (total === x) return nums.length

var sum = 0
var head = 0
var max = -1
for (var tail = 0; tail < nums.length; tail++) {
sum += nums[tail]
while (sum > total - x) {
sum -= nums[head]
head++
}
if (sum === total - x) max = Math.max(max, tail - head + 1)
}

return max === -1 ? -1 : nums.length - max
}