题目描述：
Given a sorted positive integer array nums and an integer n, add/patch elements to the array such that any number in range [1, n] inclusive can be formed by the sum of some elements ...
归档 2016年1月
[LeetCode]Patching Array
[LeetCode]String to Integer (atoi)
作者是
发布于
在
LeetCode.
题目描述：
Implement atoi to convert a string to an integer.
Hint: Carefully consider all possible input cases. If you want a challenge, please do not see below and ask yourself what are the possible input cases.
Notes: It is intended ...
Eclipse正则表达式查找匹配多行
作者是
发布于
在
他山之石.
使用Eclipse的正则表达式（Regular expressions）查找替换（Find/Replace）功能时，如果需要匹配多行，可以在搜索表达式中添加(?s)参数。
例如从下面的HTML文本中匹配<p class="strong"></p>的段落内容
可以采用正则表达式：(?s)<p class="strong">.*?</p>
<!doctype html>
<html>
<head>
<title>Example Domain</title>
<meta charset="utf-8" />
<style type="text/css ...
[LeetCode]Longest Increasing Path in a Matrix
作者是
发布于
在
LeetCode.
题目描述：
LeetCode 329. Longest Increasing Path in a Matrix
Given an integer matrix, find the length of the longest increasing path.
From each cell, you can either move to four directions: left, right, up or down. You may NOT move ...
[LeetCode]Odd Even Linked List
作者是
发布于
在
LeetCode.
题目描述：
Given a singly linked list, group all odd nodes together followed by the even nodes. Please note here we are talking about the node number and not the value in the nodes.
You should try to do it in ...