upload Lesson 16

Author: Mickey0521

16-GreedyAlgorithms_cckao.pdf

@@ -0,0 +1,27 @@
+# you can write to stdout for debugging purposes, e.g.
+# print("this is a debug message")
+
+def solution(A, B):
+    # write your code in Python 3.6
+
+    # the array is already sorted by B (the right end)
+    
+	# special cases (zero or only one)
+    if len(A) == 0:
+        return 0
+    elif len(A) == 1:
+        return 1
+    
+	# keep 'the current right-end' and 'the current left-end'
+    current_right_end = B[0]
+    current_left_end = A[0]
+    
+    num_non_overlapping = 1
+    
+    for index in range( len(A) ):
+        current_left_end = A[index] # moving the left-end
+        if current_left_end > current_right_end:
+            num_non_overlapping += 1
+            current_right_end = B[index] # update the right-end
+    
+    return num_non_overlapping

MaxNonoverlappingSegments.py

@@ -0,0 +1,27 @@
+# you can write to stdout for debugging purposes, e.g.
+# print("this is a debug message")
+
+import copy
+
+def solution(K, A):
+    # write your code in Python 3.6
+    
+    all_rope_list = []
+    
+    current_length = 0
+    current_rope_list = []
+    for item in A:
+        current_length += item
+        current_rope_list.append(item)
+        # print(current_length)
+        if current_length >= K:
+            current_length = 0
+            # all_rope_list.append( current_rope_list ) 
+            # very important: need to use 'copy.copy()' for the current list 
+            # print(current_rope_list)
+            all_rope_list.append( copy.copy(current_rope_list) )
+            # print(all_rope_list)
+            current_rope_list.clear()
+    
+    num_rope = len(all_rope_list)
+    return num_rope