8 不迷信_只迷人

尚未进行身份认证

暂无相关简介

等级
TA的排名 2w+

实习生面试总结

每年的三月份都是实习生面试的高潮,2017年也不例外 截止到目前,总结一下: 投递的岗位包括数据研发岗以及大数据工程师1.大部分的面试官都会在简历中找到自己感兴趣的点,比赛,项目都需要再好好总结下;2.比较有印象的几道算法题: 1.给两个字符串s,t  t中含有“*?”通配符  2.在一个网络格子中,非0 即1,怎么能快速的判断是三角形,正方形以及圆? 3.给定一

2017-03-27 22:12:01

腾讯2017暑期实习生编程题器

3道编程题1. 给定一个字符串s,你可以从中删除一些字符,使得剩下的串是一个回文串。如何删除才能使得回文串最长呢? 输出需要删除的字符个数。求原字符串和其反串的最大公共子序列(不是子串,因为可以不连续)的长度(使用动态规划很容易求得),然后用原字符串的长度减去这个最大公共子串的长度就得到了最小编辑长度。#include <iostream>#include <stdio.h>#include

2017-03-20 17:39:38

hadoop Hive sql 总结

Hive 是基于Hadoop 构建的一套数据仓库分析系统,它提供了丰富的SQL查询方式来分析存储在Hadoop 分布式文件系统中的数据,可以将结构化的数据文件映射为一张数据库表,并提供完整的SQL查询功能,可以将SQL语句转换为MapReduce任务进行运行,通过自己的SQL 去查询分析需要的内容,这套SQL 简称Hive SQL,使不熟悉mapreduce 的用户很方便的利用SQL 语言查询,汇总

2017-02-22 16:28:12

Leetcode Find Peak Element 162

A peak element is an element that is greater than its neighbors.Given an input array where num[i] ≠ num[i+1], find a peak element and return its index.The array may contain multiple peaks, in that case

2017-01-14 20:33:12

Leetcode Third Maximum Number 414

Given a non-empty array of integers, return the third maximum number in this array. If it does not exist, return the maximum number. The time complexity must be in O(n).Example 1: Input: [3, 2, 1]Outp

2017-01-13 16:35:35

Leetcode Guess Number Higher or Lower 374

We are playing the Guess Game. The game is as follows:I pick a number from 1 to n. You have to guess which number I picked.Every time you guess wrong, I’ll tell you whether the number is higher or lowe

2017-01-10 20:47:54

leetcode Binary Tree Paths 257

Given a binary tree, return all root-to-leaf paths.For example, given the following binary tree:1 / \ 2 3 \ 5 All root-to-leaf paths are:[“1->2->5”, “1->3”]题目链接要找出所有的路径,考虑使用dfs/** * Def

2017-01-10 20:31:52

Leetcode Factorial Trailing Zeroes 172

Given an integer n, return the number of trailing zeroes in n!.Note: Your solution should be in logarithmic time complexity.Credits: Special thanks to @ts for adding this problem and creating all test

2017-01-10 20:05:54

Leetcode Binary Tree Level Order Traversal 102

Given a binary tree, return the level order traversal of its nodes’ values. (ie, from left to right, level by level).For example: Given binary tree [3,9,20,null,null,15,7], 3 / \ 9 20

2017-01-05 20:47:12

快速的判断一个数是不是2,3,4的幂

1.判断是不是2的幂: 如果n是2的幂二进制中有一位是1,n-1的二进制表示中剩下的都是1 则判断用n&(n-1) 如果是0 就是2的幂2.判断是不是4的幂: 如果n是4的幂,首先是2的幂:n&(n-1)=0 然后看是否在1的位置是不是在偶数位 n&(0x55555555) 为1 || n&(0xaa

2017-01-03 17:32:53

Leetcode Convert a Number to Hexadecimal 405

Given an integer, write an algorithm to convert it to hexadecimal. For negative integer, two’s complement method is used.Note:All letters in hexadecimal (a-f) must be in lowercase. The hexadecimal str

2017-01-03 16:42:44

Leetcode Longest Valid Parentheses 32

Given a string containing just the characters ‘(’ and ‘)’, find the length of the longest valid (well-formed) parentheses substring.For “(()”, the longest valid parentheses substring is “()”, which has

2017-01-02 15:58:55

Leetcode Longest Palindromic Substring 5

Given a string s, find the longest palindromic substring in s. You may assume that the maximum length of s is 1000.Example:Input: “babad”Output: “bab”Note: “aba” is also a valid answer. Example:Input:

2017-01-01 18:09:39

Leetcode Reverse Linked List II 92

Reverse a linked list from position m to n. Do it in-place and in one-pass.For example: Given 1->2->3->4->5->NULL, m = 2 and n = 4,return 1->4->3->2->5->NULL.Note: Given m, n satisfy the following co

2017-01-01 15:28:43

Leetcode Reorder List 143

Given a singly linked list L: L0→L1→…→Ln-1→Ln, reorder it to: L0→Ln→L1→Ln-1→L2→Ln-2→…You must do this in-place without altering the nodes’ values.For example, Given {1,2,3,4}, reorder it to {1,4,2,3}

2017-01-01 14:32:31

Leetcode Remove Duplicates from Sorted List II 82

Given a sorted linked list, delete all nodes that have duplicate numbers, leaving only distinct numbers from the original list.For example, Given 1->2->3->3->4->4->5, return 1->2->5. Given 1->1->1->2

2017-01-01 11:30:44

Leetcode Interleaving String 97

Given s1, s2, s3, find whether s3 is formed by the interleaving of s1 and s2.For example, Given: s1 = “aabcc”, s2 = “dbbca”,When s3 = “aadbbcbcac”, return true. When s3 = “aadbbbaccc”, return false

2016-12-31 16:02:54

Leetcode Edit Distance 72

Given two words word1 and word2, find the minimum number of steps required to convert word1 to word2. (each operation is counted as 1 step.)You have the following 3 operations permitted on a word:a) In

2016-12-30 16:23:12

Leetcode Best Time to Buy and Sell Stock III 123

Say you have an array for which the ith element is the price of a given stock on day i.Design an algorithm to find the maximum profit. You may complete at most two transactions.Note: You may not engag

2016-12-29 18:57:38

Leetcode Integer Break 343

Given a positive integer n, break it into the sum of at least two positive integers and maximize the product of those integers. Return the maximum product you can get.For example, given n = 2, return 1

2016-12-27 21:00:28

查看更多

勋章 我的勋章
  • 持之以恒
    持之以恒
    授予每个自然月内发布4篇或4篇以上原创或翻译IT博文的用户。不积跬步无以至千里,不积小流无以成江海,程序人生的精彩需要坚持不懈地积累!