From 7f6177e1609848f6760171407a3a419e287602a7 Mon Sep 17 00:00:00 2001
From: YuCheng Hu
Date: Sat, 15 Dec 2018 01:52:40 -0500
Subject: [PATCH] Submit
---
.../lang/tutorial/tests/LintcodeTest.java | 142 ++++++------------
1 file changed, 50 insertions(+), 92 deletions(-)
diff --git a/src/test/java/com/ossez/lang/tutorial/tests/LintcodeTest.java b/src/test/java/com/ossez/lang/tutorial/tests/LintcodeTest.java
index 7cf699092d..8b1a07a265 100644
--- a/src/test/java/com/ossez/lang/tutorial/tests/LintcodeTest.java
+++ b/src/test/java/com/ossez/lang/tutorial/tests/LintcodeTest.java
@@ -3,22 +3,16 @@ package com.ossez.lang.tutorial.tests;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collections;
-import java.util.HashMap;
import java.util.HashSet;
-import java.util.LinkedList;
import java.util.List;
import java.util.TreeSet;
import java.util.regex.Matcher;
import java.util.regex.Pattern;
-import javax.management.ListenerNotFoundException;
-
import org.junit.Test;
import org.slf4j.Logger;
import org.slf4j.LoggerFactory;
-import com.ossez.lang.tutorial.models.ListNode;
-
/**
*
* @author YuCheng
@@ -28,62 +22,6 @@ public class LintcodeTest {
private final static Logger logger = LoggerFactory.getLogger(LintcodeTest.class);
- /**
- * 35 https://www.lintcode.com/problem/reverse-linked-list/description
- */
- @Test
- public void test0035Reverse() {
- // INIT LINKED LIST
- ListNode head = new ListNode(1);
- head.next = new ListNode(2);
- head.next.next = new ListNode(3);
-
- // CHECK BEFORE
- System.out.println(head.val);
- System.out.println(head.next.val);
- System.out.println(head.next.next.val);
-
- // REVERSE
- ListNode prev = null;
- while (head != null) {
- ListNode temp = head.next;
- head.next = prev;
- prev = head;
- head = temp;
- }
-
- // CHECK AFTER
- System.out.println(prev.val);
- System.out.println(prev.next.val);
- System.out.println(prev.next.next.val);
- }
-
- /**
- * 1480 https://www.lintcode.com/problem/dot-product/description
- */
- @Test
- public void test0044minSubArray() {
-
- List nums = new ArrayList();
- nums.add(1);
- nums.add(1);
-
- int min_ending_here = 0;
- int retStatus = 0;
-
- for (int i = 0; i < nums.size(); i++) {
- if (min_ending_here > 0) {
- min_ending_here = nums.get(i);
- } else {
- min_ending_here += nums.get(i);
- }
- retStatus = Math.min(retStatus, min_ending_here);
- }
-
- System.out.println(retStatus);
-
- }
-
/**
* 53 https://www.lintcode.com/problem/reverse-words-in-a-string/description
*/
@@ -156,36 +94,6 @@ public class LintcodeTest {
System.out.println("" + retStatus);
}
- /**
- * 411
- *
- *
- *
- *
- *
- */
- @Test
- public void test0411GrayCode() {
- int n = 2;
-
- List retArray = new ArrayList<>();
-
- if (n == 0) {
- retArray.add(0);
- }
-
- for (int i = 0; i < (2 << (n - 1)); i++) {
- int g = i ^ (i / 2);
- retArray.add(g);
- }
-
- System.out.println(retArray);
- }
-
/**
* 1480 https://www.lintcode.com/problem/dot-product/description
*/
@@ -290,4 +198,54 @@ public class LintcodeTest {
System.out.println(strSet.size());
}
+ /**
+ * 1480 https://www.lintcode.com/problem/dot-product/description
+ */
+ @Test
+ public void test1480dotProduct() {
+ int[] A = { 1, 1, -1 };
+ int[] B = { 2147483647, 1, 3 };
+
+ int retStatus = 0;
+
+ // LENGTH CHECK
+ if (A.length == 0 || B.length == 0 || A.length != B.length)
+ retStatus = -1;
+
+ // ADDED
+ if (retStatus != -1) {
+ for (int i = 0; i < A.length; i++) {
+ retStatus = retStatus + A[i] * B[i];
+ }
+ }
+
+ System.out.println(retStatus);
+ }
+
+ /**
+ * 1480 https://www.lintcode.com/problem/dot-product/description
+ */
+ @Test
+ public void test0044minSubArray() {
+
+ List nums = new ArrayList();
+ nums.add(1);
+ nums.add(1);
+
+ int min_ending_here = 0;
+ int retStatus = 0;
+
+ for (int i = 0; i < nums.size(); i++) {
+ if (min_ending_here > 0) {
+ min_ending_here = nums.get(i);
+ } else {
+ min_ending_here += nums.get(i);
+ }
+ retStatus = Math.min(retStatus, min_ending_here);
+ }
+
+ System.out.println(retStatus);
+
+ }
+
}