且听疯吟-优快云博客

原创做事情的基本原则

第一步，找一个标杆，Benchmark，确定努力的目标。第二步，分析现状，找出现状与目标的差异，Diffence。第三步，制定行动计划，明确做那些工作缩小与标杆的差距。第四步，跟进，Follow Up。加强执行落地...

2018-03-28 10:15:16 1224

（一）为什么要换工作　　九十年代中期，我国银行业的信息化建设如火如涂的进行着，由著名的“两天两联”统领，我也正是在那个时期进入这一领域的。那时做项目的特点是：客户水平较低，集成商在项目中处于统领地位，项目组的成员工作虽然十分辛苦，但住的是宾馆，吃的也不错，每年的薪水也会上涨。在这个时期做项目，自我感觉良好，而且那时自己也年轻，想得不多。　　情况发身变化，我觉得是从2002年开始的，国内系统集成行...

2018-03-20 08:21:32 16399 5

原创 797. All Paths From Source to Target

797. All Paths From Source to Target点击打开链接Given a directed, acyclic graph of N nodes. Find all possible paths from node 0 to node N-1, and return them in any order.The graph is given as follows: the...

2018-03-19 13:59:44 555

原创 684. Redundant Connection

class Solution {public: vector<int> findRedundantConnection(vector<vector<int>>& edges) { int len = edges.size(); vector<int> parent(2000,0); v...

2018-03-16 13:57:06 338

原创 712. Minimum ASCII Delete Sum for Two Strings

Given two strings s1, s2, find the lowest ASCII sum of deleted characters to make two strings equal.Example 1:Input: s1 = "sea", s2 = "eat"Output: 231Explanation: Deleting "s" from "sea" add

2018-01-07 11:06:37 266

转载不要一辈子靠技术生存

IT人不要一辈子靠技术生存(转）转载 2016年04月01日 16:18:52474我现在是自己做，但我此前有多年在从事软件开发工作，当回过头来想一想自己，觉得特别想对那些初学JAVA/DOT。NET技术的朋友说点心里话，希望你们能从我们的体会中，多少受点启发(也许我说的不好，你不赞同但看在我真心的份上别扔砖头啊). 一。在中国你千万不要

2018-01-02 12:44:41 528

转载任总讲话

任总谈干部任免：茶壶里的饺子我们是不承认的！ 2017-12-27 11:49 1059142只看楼主（转）管理干部是一个组织发展的中坚力量，干部队伍的好坏将直接决定一个组织能走多远。任正非认为，品德与作风是干部的资格底线，要严防说小话、拨弄是非、背后随意议论人的人进入干部队伍，对腐败的干部必须清除，绝不迁就。任正非总结

2017-12-29 09:23:29 620

原创 742. Closest Leaf in a Binary Tree

Given a binary tree where every node has a unique value, and a target key k, find the value of the closest leaf node to target k in the tree.Here, closest to a leaf means the least number of edges trav

2017-12-18 23:08:58 270

转载职场生涯

作者：歪叔链接：https://www.zhihu.com/question/26553748/answer/51540968 来源：知乎著作权归作者所有。商业转载请联系作者获得授权，非商业转载请注明出处。1、人无远虑，必有近忧。时刻要有危机意识、时刻保持学习性。这是道。 2、30岁后的工作，想办法要达到一种境界：如果要跳槽，都是别人请自己过去。这是目的。下面是术。 3、积累人脉。我

2017-11-03 12:41:54 271

转载凌小宁教授给软件新人的演讲——选择的力量

9月9日下午3点，凌小宁教授在复临舍报告厅07级新生做了题为“人生的选择是天使也是魔鬼”的主题演讲。演讲中，凌教授向同学们讲解了成为软件业领军人物所应具备的五种能力，以及在学习与人生中如何抉择，同时他也强调，在学习生活中一定要打好基础，动手实践。他说，当你离开父母走进大学，你就有了选择的自由，选择的力量。你可以选择你自己方式，做你喜欢的事，实现你的梦。但是，选择的力量既是天使又是魔鬼，可

2017-11-02 08:17:54 1695

原创文章标题

Given a non-empty list of words, return the k most frequent elements.Your answer should be sorted by frequency from highest to lowest. If two words have the same frequency, then the word with the lower

2017-11-01 23:12:11 218

原创确定自己的技术路线

方知勤能补拙。

2017-10-16 22:22:43 545

原创 72. Edit Distance

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 permitted on a word:a) In

2017-10-12 12:24:11 343

原创 10.9日计划

1.完成python的学习:主要针对函数和高级特性这两部分,并将完成的python代码在远程VPS服务器上填写完整。2.完成leetcode算法题目两道：本月的计划主要针对动态规划、深度遍历和广度遍历的题目。3.完成自传的阅读：主要是针对李鸿章传记的阅读。4.完成正常工作的其他部分。5.希望明天晚上能够写出一点总结。

2017-10-08 23:09:10 211

原创 354. Russian Doll Envelopes

You have a number of envelopes with widths and heights given as a pair of integers (w, h). One envelope can fit into another if and only if both the width and height of one envelope is greater than the

2017-09-29 16:54:54 233

原创 174. Dungeon Game

The demons had captured the princess (P) and imprisoned her in the bottom-right corner of a dungeon. The dungeon consists of M x N rooms laid out in a 2D grid. Our valiant knight (K) was initially posi

2017-09-29 10:56:13 255

原创 17. Letter Combinations of a Phone Number

Given a digit string, return all possible letter combinations that the number could represent.A mapping of digit to letters (just like on the telephone buttons) is given below.这道题目非常简单的题目，用递归或者队列非常容易做

2017-09-28 21:46:53 258

原创 474. Ones and Zeroes

In the computer world, use restricted resource you have to generate maximum benefit is what we always want to pursue.For now, suppose you are a dominator of m 0s and n 1s respectively. On the other han

2017-09-28 13:13:02 194

原创 368. Largest Divisible Subset

Given a set of distinct positive integers, find the largest subset such that every pair (Si, Sj) of elements in this subset satisfies: Si % Sj = 0 or Sj % Si = 0.If there are multiple solutions, return

2017-09-28 12:51:15 272

原创 646. Maximum Length of Pair Chain

You are given n pairs of numbers. In every pair, the first number is always smaller than the second number.Now, we define a pair (c, d) can follow another pair (a, b) if and only if b < c. Chain of pai

2017-09-28 10:59:40 231

原创 312. Burst Balloons

Given n balloons, indexed from 0 to n-1. Each balloon is painted with a number on it represented by array nums. You are asked to burst all the balloons. If the you burst balloon i you will get nums[lef

2017-09-28 09:28:21 186

原创 115. Distinct Subsequences

Given a string S and a string T, count the number of distinct subsequences of S which equals T.A subsequence of a string is a new string which is formed from the original string by deleting some (can b

2017-09-27 17:48:14 255

原创 32. Longest Valid Parentheses

Given a string containing just the characters '(' and ')', find the length of the longest valid (well-formed) parentheses substring.For "(()", the longest valid parentheses substring is "()", which has

2017-09-27 10:32:49 217

原创 132. Palindrome Partitioning II

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 s = "aab",Return 1 since t

2017-09-27 00:36:15 198

原创 403. Frog Jump

A frog is crossing a river. The river is divided into x units and at each unit there may or may not exist a stone. The frog can jump on a stone, but it must not jump into the water.Given a list of ston

2017-09-26 13:33:47 307

原创 97. Interleaving String

Given s1, s2, s3, find whether s3 is formed by the interleaving of s1 and s2.For example,Given:s1 = "aabcc",s2 = "dbbca",When s3 = "aadbbcbcac", return true.When s3 = "aadbbbaccc", return false.这道

2017-09-24 23:46:07 190

原创 375. Guess Number Higher or Lower II

We are playing the Guess Game. The game is as follows:I pick a number from 1 to n. You have to guess which number I picked.Every time you guess wrong, I'll tell you whether the number I picked is highe

2017-09-24 18:10:30 211

原创 467. Unique Substrings in Wraparound String

Consider the string s to be the infinite wraparound string of "abcdefghijklmnopqrstuvwxyz", so s will look like this: "...zabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcd....".Now we have anot

2017-09-23 20:43:47 238

原创 139. Word Break

Given a non-empty string s and a dictionary wordDict containing a list of non-empty words, determine if s can be segmented into a space-separated sequence of one or more dictionary words. You may assum

2017-09-22 12:43:54 206

原创 576. Out of Boundary Paths

There is an m by n grid with a ball. Given the start coordinate (i,j) of the ball, you can move the ball to adjacent cell or cross the grid boundary in four directions (up, down, left, right). However,

2017-09-22 08:18:44 639

原创 304. Range Sum Query 2D - Immutable

Given a 2D matrix matrix, find the sum of the elements inside the rectangle defined by its upper left corner (row1, col1) and lower right corner (row2, col2).Range Sum Query 2DThe above rectangle (wit

2017-09-21 23:56:38 164

原创 343. Integer Break

Given a positive integer n, break it into the sum of at least two positive integers and maximize the product of those integers. Return the maximum product you can get.For example, given n = 2, return 1

2017-09-21 17:07:37 165

原创 300. Longest Increasing Subsequence

Given an unsorted array of integers, find the length of longest increasing subsequence.For example,Given [10, 9, 2, 5, 3, 7, 101, 18],The longest increasing subsequence is [2, 3, 7, 101], therefore t

2017-09-21 10:11:59 195

原创 213. House Robber II

Note: This is an extension of House Robber.After robbing those houses on that street, the thief has found himself a new place for his thievery so that he will not get too much attention. This time, all

2017-09-21 00:47:46 195

原创 516. Longest Palindromic Subsequence

Given a string s, find the longest palindromic subsequence's length in s. You may assume that the maximum length of s is 1000.Example 1:Input:"bbbab"Output:4One possible longest palindromic subsequ

2017-09-21 00:31:02 160

原创 221. Maximal Square

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

2017-09-20 00:09:01 230

原创 647. Palindromic Substrings

Given a string, your task is to count how many palindromic substrings in this string.The substrings with different start indexes or end indexes are counted as different substrings even they consist of

2017-09-19 23:43:20 279

原创 376. Wiggle Subsequence

A sequence of numbers is called a wiggle sequence if the differences between successive numbers strictly alternate between positive and negative. The first difference (if one exists) may be either posi

2017-09-19 16:53:25 319

原创 264. Ugly Number II

class Solution {public: int nthUglyNumber(int n) { int cnt = 1; vector<int> dp(n,0); if(n == 1){ return 1; } /*index of the merge sort*/ i

2017-09-19 16:50:28 281

原创 279. Perfect Squares

Given a positive integer n, find the least number of perfect square numbers (for example, 1, 4, 9, 16, …) which sum to n.For example, given n = 12, return 3 because 12 = 4 + 4 + 4; given n = 13, retu

2017-09-19 12:57:26 298

空空如也

空空如也