Commit 6f9f9e0

committed

Update solutions

1 parent 413a272 commit 6f9f9e0Copy full SHA for 6f9f9e0

File tree

+72

-0

lines changed

+72

-0

lines changed

Lines changed: 18 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,18 @@`
	`1`	`+import 'dart:math';`
	`2`	`+`
	`3`	`+int maxArea(List<int> height) {`
	`4`	`+ var left = 0;`
	`5`	`+ var right = height.length - 1;`
	`6`	`+ var most = 0;`
	`7`	`+`
	`8`	`+ while (left <= right) {`
	`9`	`+ most = max(most, min(height[left], height[right]) * (right - left));`
	`10`	`+ if (height[left] < height[right]) {`
	`11`	`+ left += 1;`
	`12`	`+ } else {`
	`13`	`+ right -= 1;`
	`14`	`+ }`
	`15`	`+ }`
	`16`	`+`
	`17`	`+ return most;`
	`18`	`+}`

Lines changed: 18 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,18 @@`
	`1`	`+import 'dart:math';`
	`2`	`+`
	`3`	`+int maxSubArray(List<int> nums) {`
	`4`	`+ var curr = nums[0];`
	`5`	`+`
	`6`	`+ if (nums.length == 1) {`
	`7`	`+ return curr;`
	`8`	`+ }`
	`9`	`+`
	`10`	`+ var total = nums[0];`
	`11`	`+ for (var i = 1; i < nums.length; ++i) {`
	`12`	`+ final num = nums[i];`
	`13`	`+ curr = max(num, num + curr);`
	`14`	`+ total = max(total, curr);`
	`15`	`+ }`
	`16`	`+`
	`17`	`+ return total;`
	`18`	`+}`

Lines changed: 2 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -2,7 +2,9 @@ library leetcode;`
`2`	`2`
`3`	`3`	`export 'array/contains_duplicate.dart';`
`4`	`4`	`export 'array/longest_common_prefix.dart';`
	`5`	`+export 'array/max_area.dart';`
`5`	`6`	`export 'array/max_profit.dart';`
	`7`	`+export 'array/max_sub_array.dart';`
`6`	`8`	`export 'array/permute.dart';`
`7`	`9`	`export 'array/remove_element.dart';`
`8`	`10`	`export 'array/single_number.dart';`

Lines changed: 15 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,15 @@`
	`1`	`+`
	`2`	`+import 'package:leetcode/leetcode.dart';`
	`3`	`+import 'package:test/test.dart';`
	`4`	`+`
	`5`	`+void main() {`
	`6`	`+ test('example 1', () {`
	`7`	`+ var expected = 49;`
	`8`	`+ expect(maxArea([1, 8, 6, 2, 5, 4, 8, 3, 7]), expected);`
	`9`	`+ });`
	`10`	`+`
	`11`	`+ test('example 2', () {`
	`12`	`+ var expected = 1;`
	`13`	`+ expect(maxArea([1, 1]), expected);`
	`14`	`+ });`
	`15`	`+}`

Lines changed: 19 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,19 @@`
	`1`	`+import 'package:leetcode/leetcode.dart';`
	`2`	`+import 'package:test/test.dart';`
	`3`	`+`
	`4`	`+void main() {`
	`5`	`+ test('example 1', () {`
	`6`	`+ var expected = 6;`
	`7`	`+ expect(maxSubArray([-2, 1, -3, 4, -1, 2, 1, -5, 4]), equals(expected));`
	`8`	`+ });`
	`9`	`+`
	`10`	`+ test('example 2', () {`
	`11`	`+ var expected = 1;`
	`12`	`+ expect(maxSubArray([1]), equals(expected));`
	`13`	`+ });`
	`14`	`+`
	`15`	`+ test('example 3', () {`
	`16`	`+ var expected = 23;`
	`17`	`+ expect(maxSubArray([5, 4, -1, 7, 8]), equals(expected));`
	`18`	`+ });`
	`19`	`+}`

Comments

(0)