摘要：
126 def map1(): 127 """ 128 map1 129 """ 130 if "2030" not in os.getenv('map_input_file'): 131 get_data_from_easylog() 132 else: 133 mapper_get_gcf_ve 阅读全文
摘要：
#! /bin/bashn=`head data|wc -l`a=$(echo "$n*0.8"|bc)int_a=`printf "%0.0f" $a`echo $int_ahead -n$int_a data 阅读全文
摘要：
1.默认情况在hadoop streaming的默认情况下，是以"\t"作为分隔符的。对于标准输入来说，每行的第一个"\t" 以前的部分为key，其他部分为对应的value。如果一个"\t"字符没有，则整行都被当做key。这个<key,value>即是map阶段的输出，也是reduce阶段的输入。 阅读全文
摘要：
https://labuladong.gitbook.io/algo/mu-lu-ye/hua-dong-chuang-kou-ji-qiao-jin-jie 滑动窗口题目: 3. 无重复字符的最长子串 class Solution { public: int lengthOfLongestSubs 阅读全文
摘要：
课程中, 作者将DP的问题分成以下几类: 1. 0/1 Knapsack, 0/1背包，6个题 0/1 Knapsack，0/1背包问题 Equal Subset Sum Partition，相等子集划分问题 Subset Sum，子集和问题 Minimum Subset Sum Differenc 阅读全文
摘要：
Given an array nums containing n + 1 integers where each integer is between 1 and n (inclusive), prove that at least one duplicate number must exist. 阅读全文
摘要：
You are a product manager and currently leading a team to develop a new product. Unfortunately, the latest version of your product fails the quality c 阅读全文
摘要：
Given an array of citations sorted in ascending order (each citation is a non-negative integer) of a researcher, write a function to compute the resea 阅读全文
摘要：
Write an efficient algorithm that searches for a value in an m x n matrix. This matrix has the following properties: Integers in each row are sorted i 阅读全文
摘要：
Hard 692191Add to ListShare Suppose an array sorted in ascending order is rotated at some pivot unknown to you beforehand. (i.e., [0,1,2,4,5,6,7] migh 阅读全文