2017年10月_谛听-

原创 leetcode---add-two-numbers---链表

You are given two linked lists representing two non-negative numbers. The digits are stored in reverse order and each of their nodes contain a single digit. Add the two numbers and return it as a linke

2017-10-31 18:44:59 341

原创 leetcode---swap-nodes-in-pairs---链表

Given a linked list, swap every two adjacent nodes and return its head. For example, Given1->2->3->4, you should return the list as2->1->4->3. Your algorithm should use only constant space. You may

2017-10-30 20:11:49 226

原创 leetcode---reverse-linked-list-ii---链表

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

2017-10-29 17:13:06 215

原创链表---在有序链表中寻找中点的两种方式

当链表中的节点数为偶数，代码1找到的中点偏前，代码2找的中点偏后如：1， 2， 3， 4 代码1找到的中点为2，代码2找到的中点为3代码1 ListNode *findMid(ListNode *head) { ListNode *fast = head; ListNode *slow = head; while(fast->nex

2017-10-29 16:08:46 760

原创 leetcode---copy-list-with-random-pointer---链表

A linked list is given such that each node contains an additional random pointer which could point to any node in the list or null. Return a deep copy of the list./** * Definition for singly-linked l

2017-10-29 13:57:49 317

转载 c#---优先队列

转自 http://blog.csdn.net/luke2834/article/details/51154283using System;using System.Collections.Generic;using System.Linq;using System.Text;namespace PriorityQueue{ public class PriorityQueue<T

2017-10-27 11:09:05 490

原创 leetcode---merge-k-sorted-lists---链表

Merge k sorted linked lists and return it as one sorted list. Analyze and describe its complexity./** * Definition for singly-linked list. * struct ListNode { * int val; * ListNode *next;

2017-10-25 19:13:02 279

原创 leetcode---rotate-list---链表

Given a list, rotate the list to the right by k places, where k is non-negative. For example: Given1->2->3->4->5->NULLand k =2, return4->5->1->2->3->NULL./** * Definition for singly-linked list. *

2017-10-25 18:47:26 195

原创 Arcgis---从数据库中获取数据绘制道路

using System.Collections;using System.Collections.Generic;using System.Linq;using System.Text;using System.Data;using ESRI.ArcGIS.esriSystem;using ESRI.ArcGIS.Carto;using ESRI.ArcGIS.Controls;us

2017-10-25 10:12:52 4257

原创 leetcode---remove-duplicates-from-sorted-list---链表

Given a sorted linked list, delete all duplicates such that each element appear only once. For example, Given1->1->2, return1->2. Given1->1->2->3->3, return1->2->3./** * Definition for singly-linke

2017-10-24 19:11:49 235

原创 leetcode---partition-list---链表

Given a linked list and a value x, partition it such that all nodes less than x come before nodes greater than or equal to x. You should preserve the original relative order of the nodes in each of th

2017-10-24 18:30:21 254

原创 C#---将字符串按空格分隔

string[] line = System.Text.RegularExpressions.Regex.Replace(strline.Trim(), @"[\s]+", " ").Split(" ".ToCharArray());应用将文件mstreet解析为road.txt mstreet 9 mstreet

2017-10-23 15:20:10 8076

原创 leetcode---merge-two-sorted-lists---链表

Merge two sorted linked lists and return it as a new list. The new list should be made by splicing together the nodes of the first two lists./** * Definition for singly-linked list. * struct ListNode

2017-10-21 18:04:27 197

原创 leetcode---linked-list-cycle-ii---链表

Given a linked list, return the node where the cycle begins. If there is no cycle, returnnull. Follow up: Can you solve it without using extra space?/** * Definition for singly-linked list. * struc

2017-10-20 18:37:43 189

原创 leetcode---linked-list-cycle---链表中点

Given a linked list, determine if it has a cycle in it. Follow up: Can you solve it without using extra space?/** * Definition for singly-linked list. * struct ListNode { * int val; * Lis

2017-10-19 21:26:54 307

原创 leetcode---reorder-list---链表中点、逆转

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

2017-10-18 19:49:16 259

原创 leetcode---remove-nth-node-from-end-of-list---链表

Given a linked list, remove the n th node from the end of list and return its head. For example, Given linked list: 1->2->3->4->5, and n = 2.After removing the second node from the end, the linked

2017-10-16 14:50:24 213

原创 leetcode---jump-game---贪心

Given an array of non-negative integers, you are initially positioned at the first index of the array. Each element in the array represents your maximum jump length at that position. Determine if you

2017-10-14 20:01:16 263 1

原创 leetcode---maximum-subarray---贪心

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[4,−1,2,1]has the

2017-10-14 19:18:50 313

原创 leetcode---binary-tree-level-order-traversal-ii---树层次遍历

Given a binary tree, return the bottom-up level order traversal of its nodes’ values. (ie, from left to right, level by level from leaf to root). For example: Given binary tree{3,9,20,#,#,15,7},

2017-10-13 20:59:45 242

转载 gdb调试参数

原文：http://blog.csdn.net/on_fighting/article/details/50855559r(run) 开始运行程序； c(continue) 继续运行一直到断点停止 b(break) 设置程序断点 p(print) 打印变量值 s(step) 单步跟踪，进入函数内部 n(next) 单步跟踪，不进入函数 finish 跳出函数

2017-10-12 22:37:28 360

原创 wps中公式所占空间较大

解决：选中段落，右击，选则“段落”，去除“如果定义了文档网格，则与网格对去”前面的复选框

2017-10-11 11:53:30 1985

原创 leetcode---recover-binary-search-tree---树

Two elements of a binary search tree (BST) are swapped by mistake. Recover the tree without changing its structure. Note: A solution using O(n ) space is pretty straight forward. Could you devise a

2017-10-10 19:07:39 291

原创 leetcode---binary-tree-preorder-traversal---树前序遍历

Given a binary tree, return the preorder traversal of its nodes’ values. For example: Given binary tree{1,#,2,3}, 1 \ 2 / 3return[1,2,3]. Note: Recursive solution is trivial,

2017-10-07 12:32:01 201

原创 leetcode---binary-tree-postorder-traversal---树后续遍历

Given a binary tree, return the postorder traversal of its nodes’ values. For example: Given binary tree{1,#,2,3}, 1 \ 2 / 3return[3,2,1]. Note: Recursive solution is trivial

2017-10-07 12:27:41 187

原创 leetcode---path-sum-ii---树

Given a binary tree and a sum, find all root-to-leaf paths where each path’s sum equals the given sum. For example: Given the below binary tree andsum = 22, 5 / \

2017-10-06 16:43:26 235

原创 leetcode---path-sum---树

Given a binary tree and a sum, determine if the tree has a root-to-leaf path such that adding up all the values along the path equals the given sum. For example: Given the below binary tree andsum =

2017-10-06 16:35:59 203

原创 leetcode---binary-tree-maximum-path-sum---树

Given a binary tree, find the maximum path sum. The path may start and end at any node in the tree. For example: Given the below binary tree, 1 / \ 2 3Return6./** * Definitio

2017-10-06 16:11:04 316

原创 leetcode---sum-root-to-leaf-numbers---树

Given a binary tree containing digits from0-9only, each root-to-leaf path could represent a number. An example is the root-to-leaf path1->2->3which represents the number123. Find the total sum of all

2017-10-05 12:58:02 320

原创 leetcode---generate-parentheses---dfs

Given n pairs of parentheses, write a function to generate all combinations of well-formed parentheses. For example, given n = 3, a solution set is: “((()))”, “(()())”, “(())()”, “()(())”, “()()()”cl

2017-10-03 18:20:20 311

原创 leetcode---combination-sum-ii---dfs

Given a collection of candidate numbers ( C ) and a target number ( T ), find all unique combinations in C where the candidate numbers sums to T . Each number in C may only be used once in the combina

2017-10-02 15:21:10 212

原创 leetcode---combination-sum---dfs

Given a set of candidate numbers ( C ) and a target number ( T ), find all unique combinations in C where the candidate numbers sums to T . The same repeated number may be chosen from C unlimited numb

2017-10-01 16:22:21 223

原创 leetcode---search-in-rotated-sorted-array---查找

题目描述Suppose a sorted array is rotated at some pivot unknown to you beforehand. (i.e.,0 1 2 4 5 6 7might become4 5 6 7 0 1 2). You are given a target value to search. If found in the array return its

2017-10-01 15:45:43 339

原创 leetcode---search-insert-position---查找

Given a sorted array and a target value, return the index if the target is found. If not, return the index where it would be if it were inserted in order. You may assume no duplicates in the array. H

2017-10-01 15:24:18 257

原创 leetcode---search-for-a-range---查找

Given a sorted array of integers, find the starting and ending position of a given target value. Your algorithm’s runtime complexity must be in the order of O(log n). If the target is not found in th

2017-10-01 15:13:08 379

新博客：https://aping-dev.com/