the-fejw

public static int[] findMaxSubArray(int[] A, int low, int high) {
	int[] result = new int[3];	
	
	if (high == low) {
		result[0] = low;
		result[1] = high;
		result[2] = A[low];
	} else {
		int mid = (low + high) / 2;
		int[] leftResult = findMaxSubArray(A, low, mid);

the-fejw

public static int[] bruteForce(int[] A, int low, int high) {
	int[] result = new int[3];	//result[0]: max-left, result[1]: max-right, result[2]: max-sum
	int sum = 0;
	int maxSum = Integer.MIN_VALUE;

	for (int i = low; i <= high; i++) {
		for (int j = i; j <= high; j++) {
			sum += A[j];
			if (sum > maxSum) {
				maxSum = sum;

the-fejw

/**
 * Definition for singly-linked list.
 * public class ListNode {
 *     int val;
 *     ListNode next;
 *     ListNode(int x) {
 *         val = x;
 *         next = null;
 *     }
 * }

the-fejw

/**
 * Definition for singly-linked list.
 * class ListNode {
 *     int val;
 *     ListNode next;
 *     ListNode(int x) {
 *         val = x;
 *         next = null;
 *     }
 * }

the-fejw

/**
 * Definition for singly-linked list.
 * class ListNode {
 *     int val;
 *     ListNode next;
 *     ListNode(int x) {
 *         val = x;
 *         next = null;
 *     }
 * }

the-fejw

# Definition for singly-linked list.
# class ListNode:
#     def __init__(self, x):
#         self.val = x
#         self.next = None

class Solution:
    # @param head, a ListNode
    # @return a ListNode
    def deleteDuplicates(self, head):

the-fejw

/**
 * Definition for singly-linked list.
 * public class ListNode {
 *     int val;
 *     ListNode next;
 *     ListNode(int x) {
 *         val = x;
 *         next = null;
 *     }
 * }

the-fejw

# Definition for singly-linked list.
# class ListNode:
#     def __init__(self, x):
#         self.val = x
#         self.next = None

class Solution:
    # @param two ListNodes
    # @return a ListNode
    def mergeTwoLists(self, l1, l2):

the-fejw

/**
 * Definition for singly-linked list.
 * public class ListNode {
 *     int val;
 *     ListNode next;
 *     ListNode(int x) {
 *         val = x;
 *         next = null;
 *     }
 * }

the-fejw

/**
 * Definition for binary tree
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
public class Solution {