qq_33755214的博客

原创 数据分析岗位可视化分析

原创 Loan Prediction

#Loan Prediction（银行贷款预测分析） 项目地址：https://datahack.analyticsvidhya.com/contest/practice-problem-loan-prediction-iii/ import pandas as pd import numpy as np import matplotlib as plt %matplotlib inline df...

原创 NP-complete problems

先介绍下关于这个NP完全问题的一些基本概念： 1) P 多项式时间内可以被确定型图灵机求解的问题。 2) NP 一般有两个定义： 1. 多项式时间内可以被非确定型图灵机求解的问题； 2. 多项式时间内可以通过确定型图灵机验证解的问题； 3) NP-hard： 比所有的NP问题都难的问题 4)NP-complete：满足两点：   1. 是NP hard的

原创 leetcode Decode Ways

Description: A message containing letters from A-Z is being encoded to numbers using the following mapping: 'A' -> 1 'B' -> 2 ... 'Z' -> 26 Given an encoded message containing digits, dete

原创 leetcode Triangle

Description: Given a triangle, find the minimum path sum from top to bottom. Each step you may move to adjacent numbers on the row below. For example, given the following triangle [ [2

原创 leetcode Unique Binary Search Trees

Description: Given n, how many structurally unique BST's (binary search trees) that store values 1...n? For example, Given n = 3, there are a total of 5 unique BST's. 1 3 3

原创 leetcode Maximal Rectangle

Description: Given a 2D binary matrix filled with 0's and 1's, find the largest rectangle containing only 1's and return its area. For example, given the following matrix: 1 0 1 0 0 1 0 1 1 1

原创 leetcode Edit Distance

Description: 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 pe

原创 leetcode Regular Expression Matching

Description: Implement regular expression matching with support for '.' and '*'. '.' Matches any single character. '*' Matches zero or more of the preceding element. The matching should cov

原创 leetcode Unique Paths && Unique Paths

Desciption: Unique Paths A robot is located at the top-left corner of a m x n grid (marked 'Start' in the diagram below). The robot can only move either down or right at any point in time. Th

原创 leetcode Palindrome Partitioning II

Description: Given a string s, partition s such that every substring of the partition is a palindrome. Return the minimum cuts needed for a palindrome partitioning of s. For example, given 

原创 leetcode Palindrome Partitioning

Description: Given a string s, partition s such that every substring of the partition is a palindrome. Return all possible palindrome partitioning of s. For example, given s = "aab", Return [ [

原创 leetcode Longest Palindromic Substring

Description: 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

原创 leetcode Median of Two Sorted Arrays

Description: There are two sorted arrays nums1 and nums2 of size m and n respectively. Find the median of the two sorted arrays. The overall run time complexity should be O(log (m+n)). Example

原创 leetcode Longest Substring Without Repeating Characters Description: Given a string, find the leng

Description: Given a string, find the length of the longest substring without repeating characters. Examples: Given "abcabcbb", the answer is "abc", which the length is 3. Given "bbbbb", the answe

原创 leetcode DFS

图的遍历为从图中某一顶点出发访遍图中其余顶点，且使每一个顶点仅被访问一次的过程。

原创 leetcode Symmetric Tree

Description: Given a binary tree, check whether it is a mirror of itself (ie, symmetric around its center). For example, this binary tree [1,2,2,3,4,4,3] is symmetric:     1    / \   2   2  / \

原创 leetcode Maximum Subarray

Description: Find the contiguous subarray within an array (containing at least one number) which has the largest sum. For example, given the array [-2,1,-3,4,-1,2,1,-5,4], the contiguous subarray [

原创 leetcode Majorty Element

Description: Given an array of size n, find the majority element. The majority element is the element that appears more than ⌊ n/2 ⌋ times. You may assume that the array is non-empty and the majori