- 博客(8)
- 收藏
- 关注
转载 【LeetCode算法题库】Day7:Remove Nth Node From End of List & Valid Parentheses & Merge Two Lists...
【Q19】Given a linked list, remove then-th node from the end of list and return its head.Example:Given linked list: 1->2->3->4->5, and n = 2.After removing the second node fr...
2019-02-06 06:11:00 156
转载 【LeetCode算法题库】Day5:Roman to Integer & Longest Common Prefix & 3Sum
【Q13】Roman numerals are represented by seven different symbols:I,V,X,L,C,DandM.Symbol ValueI 1V 5X 10L 50C ...
2019-02-04 03:14:00 150
转载 【Python学习笔记】正则表达式
Ref:https://deerchao.net/tutorials/regex/regex.htm#greedyandlazy1. 常用元字符2.字符转义查找元字符本身时,需要使用\来取消这些字符的特殊意义。因此,应该使用\.和\*。查找\本身时也得用\\.3.重复e.g:Windows\d+ : 匹配Windows后面跟1个或更...
2019-02-02 21:30:00 116
转载 【LeetCode算法题库】Day4:Regular Expression Matching & Container With Most Water & Integer to Roman...
【Q10】Given an input string (s) and a pattern (p), implement regular expression matching with support for'.'and'*'.'.' Matches any single character.'*' Matches zero or more of the precedi...
2019-02-02 21:13:00 149
转载 【LeetCode算法题库】Day3:Reverse Integer & String to Integer (atoi) & Palindrome Number
[Q7] 把数倒过来Given a 32-bit signed integer, reverse digits of an integer.Example 1:Input: 123Output: 321Example 2:Input: -123Output: -321Example 3:Input: 120Output: 21Soluti...
2019-02-02 21:12:00 153
转载 【LeetCode算法题库】Day2:Median of Two Sorted Arrays & Longest Palindromic Substring & ZigZag Conversion...
[Q4]There are two sorted arraysnums1andnums2of size m and n respectively.Find the median of the two sorted arrays. The overall run time complexity should be O(log (m+n)).You may assumen...
2019-02-01 06:51:00 91
转载 【LeetCode算法题库】Day1:TwoSums & Add Two Numbers & Longest Substring Without Repeating Characters...
[Q1] Given an array of integers, returnindicesof the two numbers such that they add up to a specific target.You may assume that each input would haveexactlyone solution, and you may not use...
2019-01-31 05:28:00 126
转载 【求职】字节跳动2019校招机器学习算法工程师面试
面试问题总结。问题:1. 自我介绍。2. 介绍了一下自己简历上的项目。3. SVM详细原理。4. Kmeans原理,何时停止迭代。算法题:1. 一个随机整数产生器产生[1,5],如何设计一个产生[1,7]的随机整数产生器。解法:设k1,k2属于[1,5], 生成k3 = 5*(k1-1)+k2+1, 则k3属于[1,25], 将k3分成两个部分,[1,21]和[22,25]...
2019-01-29 18:40:00 97
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人