2017年11月_MVincent

原创 leetcode 717 1-bit and 2-bit Characters

Javaclass Solution { public boolean isOneBitCharacter(int[] bits) { int len=bits.length,i=0; while(i<len-1){ if(bits[i]==0) i++; else i+=2; }

2017-11-30 16:52:40 218

原创 leetcode 11 Container With Most Water

Javaclass Solution { public int maxArea(int[] height) { int left=0,right=height.length-1; int maxAir=0; while(left<right){ maxAir=Math.max(maxAir,Mat

2017-11-24 23:34:23 144

原创 leetcode 724 Find Pivot Index

Java:class Solution { public int pivotIndex(int[] nums) { int sum=0,sum_piv=0; for(int i=0;i<nums.length;i++) sum+=nums[i]; for(int i=0;i<nums.length;i++){ if

2017-11-17 16:29:05 580

原创 Leetcode 21 Merge Two Sorted Lists

Java:class Solution { public ListNode mergeTwoLists(ListNode l1, ListNode l2) { if(l1==null) return l2; if(l2==null) return l1; if(l1.val<l2.val){ l1.next=mer

2017-11-16 16:17:07 187

原创 (sklearn)逻辑回归linear_model.LogisticRegression用法

class sklearn.linear_model.LogisticRegression(penalty=’l2’, dual=False, tol=0.0001, C=1.0, fit_intercept=True, intercept_scaling=1, class_weight=None, random_state=None, solver=’liblinear’, max_iter=1

2017-11-10 14:53:11 24095 2

原创 leetcode 5 Longest Palindromic Substring

java:class Solution: def longestPalindrome(self, s): """ :type s: str :rtype: str """ res="" for i in range(len(s)): tmp=self.isPalindro

2017-11-10 11:05:05 153

原创 leetcode 9 Palindrome Number

java:class Solution { public boolean isPalindrome(int x) { if(x==0) return true; if(x<0||x%10==0) return false; int t=0; while(x>t){ t=t*10+x%10;

2017-11-09 16:53:37 165

原创 (sklearn)ElasticNet回归 sklearn.linear_model.ElasticNet用法

class sklearn.linear_model.ElasticNet(alpha=1.0, l1_ratio=0.5, fit_intercept=True, normalize=False, precompute=False, max_iter=1000, copy_X=True, tol=0.0001, warm_start=False, positive=False, random_s

2017-11-09 16:00:44 5441

原创 (sklearn)lasso回归linear_model.Lasso()方法

class sklearn.linear_model.Lasso(alpha=1.0, fit_intercept=True, normalize=False, precompute=False, copy_X=True, max_iter=1000, tol=0.0001,warm_start=False, positive=False, random_state=None, selection

2017-11-09 15:28:21 11152

原创 (sklearn)岭回归 sklearn.linear_model.Ridge用法

class sklearn.linear_model.Ridge(alpha=1.0,fit_intercept=True, normalize=False, copy_X=True, max_iter=None, tol=0.001, solver=’auto’, random_state=None)岭回归是一种正则化方法，通过在损失函数中加入L2范数惩罚系项，来控制线性模型的复

2017-11-09 10:26:35 8053

原创 (sklearn)linear_model.LinearRegression()用法

class sklearn.linear_model.LinearRegression(fit_intercept=True,normalize=False,copy_X=True,n_jobs=1)线性回归作为一种最简单，但却是最常用的方法。参数：fit_intercept: 布尔型，默认为true说明：是否对训练数据进行中心化,即是否需要b值，若果为False，则不需要

2017-11-08 21:41:06 13909

原创 train_test_split用法

sklearn.model_selection.train_test_split随机划分训练集和测试集官网文档：http://scikit-learn.org/stable/modules/generated/sklearn.model_selection.train_test_split.html#sklearn.model_selection.train_test_split一般形式：

2017-11-08 18:26:49 89919 6

原创 leetcode 8 String to Integer (atoi)

class Solution { public int myAtoi(String str) { if(str==null||str.length()==0) return 0; str=str.trim(); //移除前后空格 int sign=1,t=0,len=str.length(); long sum=0;

2017-11-07 15:54:34 129

原创 leetcode 7 Reverse Integer

class Solution { public int reverse(int x) { int ans=0; while(x!=0){ int n=ans; ans=10*ans+x%10; if(n!=(ans-x%10)/10) return 0; x/=1

2017-11-04 14:54:55 192

原创 leetcode 6 ZigZag Conversion

class Solution { public String convert(String s, int numRows) { char[] c=s.toCharArray(); int len=c.length; StringBuilder[] str=new StringBuilder[numRows];

2017-11-03 11:36:35 127

MRxjh的博客