Note:
1. To maximized the gap, A[i-1] will be eithor floor (1) or ceiling (B[i-1]).
2. Focus on 2 possibilities with A[i] (floor 1 or ceiling B[i]) and their possible preceedings (previous sum with floor or ceiling)
def cost(B):
top, bottom = 0, 0
- Jan 24 Thu 2019 09:05
-
HackerRank > Sherlock and Cost
- Feb 06 Sat 2016 06:48
-
Shuffle a given array
Shuffle a given array
Given an array, write a program to generate a random permutation of array elements. This question is also asked as “shuffle a deck of cards” or “randomize a given array”.
- Feb 01 Mon 2016 14:25
-
[1337c0d3 in Python] 65. Valid Number
- Feb 01 Mon 2016 13:49
-
[1337c0d3 in Python] 23. Merge k Sorted Lists
Mergeksorted linked lists and return it as one sorted list. Analyze and describe its complexity.
# Definition for singly-linked list.
# class ListNode(object):
# def __init__(self, x):
# self.val = x
- Feb 01 Mon 2016 11:46
-
[1337c0d3 in Python] 57. Insert Interval
Given a set ofnon-overlappingintervals, insert a new interval into the intervals (merge if necessary).
You may assume that the intervals were initially sorted according to their start times.
Example 1:
Given intervals[1,3],[6,9], insert and merge[2,5]in as[1,5],[6,9].
- Feb 01 Mon 2016 08:01
-
[1337c0d3 in Python] 47. Permutations II
Given a collection of numbers that might contain duplicates, return all possible unique permutations.
For example,[1,1,2]have the following unique permutations:[1,1,2],[1,2,1], and[2,1,1].
- Feb 01 Mon 2016 07:20
-
[1337c0d3 in Python] 46. Permutations
Given a collection ofdistinctnumbers, return all possible permutations.
For example,[1,2,3]have the following permutations:[1,2,3],[1,3,2],[2,1,3],[2,3,1],[3,1,2], and[3,2,1].
- Feb 01 Mon 2016 02:19
-
[1337c0d3 in Python] 198. House Robber
You are a professional robber planning to rob houses along a street. Each house has a certain amount of money stashed, the only constraint stopping you from robbing each of them is that adjacent houses have security system connected andit will automatically contact the police if two adjacent houses were broken into on the same night.
Given a list of non-negative integers representing the amount of money of each house, determine the maximum amount of money you can rob tonightwithout alerting the police.
class Solution(object):
def rob(self, nums):
"""
- Jan 31 Sun 2016 13:05
-
[1337c0d3 in Python] 287. Find the Duplicate Number
Given an arraynumscontainingn+ 1 integers where each integer is between 1 andn(inclusive), prove that at least one duplicate number must exist. Assume that there is only one duplicate number, find the duplicate one.
Note:
- Youmust notmodify the array (assume the array is read only).
- You must use only constant,O(1) extra space.
- Your runtime complexity should be less than
O(n2).
- Jan 31 Sun 2016 10:27
-
[1337c0d3 in Python] 33. Search in Rotated Sorted Array
Suppose a sorted array is rotated at some pivot unknown to you beforehand.
(i.e.,0 1 2 4 5 6 7might become4 5 6 7 0 1 2).
You are given a target value to search. If found in the array return its index, otherwise return -1.
You may assume no duplicate exists in the array.
class Solution(object):
- Jan 31 Sun 2016 08:09
-
[1337c0d3 in Python] 127. Word Ladder
Given two words (beginWordandendWord), and a dictionary's word list, find the length of shortest transformation sequence frombeginWordtoendWord, such that:
- Only one letter can be changed at a time
- Each intermediate word must exist in the word list
- Jan 31 Sun 2016 04:17
-
[Python] Write a program to print all permutations of a given string
A permutation, also called an “arrangement number” or “order,” is a rearrangement of the elements of an ordered list S into a one-to-one correspondence with S itself. A string of length n has n! permutation.
Source: Mathword(http://mathworld.wolfram.com/Permutation.html)
Below are the permutations of string ABC.
ABC, ACB, BAC, BCA, CAB, CBA
