Evolraelc-CSDN博客

原创 vue+express部署阿里云centos服务器

服务器选用：阿里云CentOS 6.8 64位（大学生好像一年10块噢，学生真好！）项目整体：使用vue-cli构建前端项目，使用express框架处理前端对数据的查询等，主要对数据库操作。在此记录下遇到的坑。一、使用XShell连接服务器连接主机的是阿里的公网ip输入密码即登录成功。二、将vue项目打包部署到服务器上1. 首先，在build/ind...

2019-02-13 16:52:35 1697

原创广州百田前端实习生面试经历

写在前面：大三就开始喜欢上了前端，入门比较晚，所以一开始错过了非常多的春招机会，等学的差不多的时候已经到六月份了，这个时候可以挑选或者是投递的机会已经不多了。第一次投酷狗的时候还没接触JS，所以被刷是必然的。接着就开始在各大网站上找实习机会，不管是小公司还是什么的，只求有个实习机会就行了。所以说，确定方向还是要早呀，没有人在前面带路指引的我十分后悔，学前端也要从娃娃抓起。...

2018-07-11 14:53:48 1760 1

转载 js 彻底理解回调函数（转）

原文链接：https://blog.csdn.net/baidu_32262373/article/details/54969696一、前奏在谈回调函数之前，先看下下面两段代码：不妨猜测一下代码的结果。function say (value) { alert(value);}alert(say);alert(say('hi js.'));12345如果你测试了，就会发现：只写变量名...

2018-07-05 09:42:36 382

原创 JSP为什么有的链接能点有的链接点不了

循环输出上面了删除和编辑链接，但是只有输出的第一个链接能点。【解决方案】给这个链接设置z-index，应该是不知由于什么原因导致链接被压在下面了。...

2018-06-28 10:39:03 617

原创 NP课后习题8.3

假设图G的最小顶点覆盖，可以构成一个HITTING SET，那么设（v1，v2），（v3，v4）…… 是G的的各条边，记为S1，S2……。通过二分式的询问可以找到一个和Si都相交的最小集合H，这正好是G的最小顶点覆盖。成立。

2017-07-06 17:48:27 287

原创 617. Merge Two Binary Trees

Given two binary trees and imagine that when you put one of them to cover the other, some nodes of the two trees are overlapped while the others are not.You need to merge them into a new binary tr

2017-07-02 16:44:28 267

原创 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 palind

2017-06-18 21:30:55 354

原创 416. Partition Equal Subset Sum(第十六周)

Given a non-empty array containing only positive integers, find if the array can be partitioned into two subsets such that the sum of elements in both subsets is equal.Note:Each of the array

2017-06-12 00:20:21 234

原创 Add to List 474. Ones and Zeroes（第十五周）

Description：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 respect

2017-06-04 22:16:17 269

原创 343. Integer Break（第十四周）

Description：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

2017-05-29 00:06:47 283

原创 376. Wiggle Subsequence（第十三周）

Description：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)

2017-05-21 23:35:26 222

原创 357. Count Numbers with Unique Digits（第十二周）

Description：Given a non-negative integer n, count all numbers with unique digits, x, where 0 ≤ x n.Example:Given n = 2, return 91. (The answer should be the total numbers in the range of 0

2017-05-14 22:33:18 192

原创 494. Target Sum（第十一周）

Description：You are given a list of non-negative integers, a1, a2, ..., an, and a target, S. Now you have 2 symbols + and -. For each integer, you should choose one from + and - as its new s

2017-05-07 19:37:50 252

原创 410. Split Array Largest Sum（第十周）

Description：Given an array which consists of non-negative integers and an integer m, you can split the array into m non-empty continuous subarrays. Write an algorithm to minimize the largest sum

2017-05-01 13:49:00 287

原创 413. Arithmetic Slices（第九周）

Description：A sequence of number is called arithmetic if it consists of at least three elements and if the difference between any two consecutive elements is the same.For example, these are

2017-04-23 20:04:26 284

原创 452. Minimum Number of Arrows to Burst Balloons（第八周）

Description：There are a number of spherical balloons spread in two-dimensional space. For each balloon, provided input is the start and end coordinates of the horizontal diameter. Since it's hor

2017-04-16 23:53:43 304

原创 329. Longest Increasing Path in a Matrix（第七周）

Description：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 diagonal

2017-04-10 00:18:58 287

原创 515. Find Largest Value in Each Tree Row（第六周）

You need to find the largest value in each row of a binary tree.Example:Input: 1 / \ 3 2 / \ \ 5 3 9 Output: [1, 3, 9]Subsc

2017-04-04 23:42:36 331

原创 529. Minesweeper(第五周)

Description：Let's play the minesweeper game (Wikipedia, online game)!You are given a 2D char matrix representing the game board. 'M' represents an unrevealed mine, 'E'represents an unrevea

2017-03-26 10:36:44 233

原创 315. Count of Smaller Numbers After Self(第四周)

Description：You are given an integer array nums and you have to return a new counts array. The counts array has the property where counts[i] is the number of smaller elements to the right of n

2017-03-17 22:14:02 253

原创 215. Kth Largest Element in an Array(第三周)

Description：Find the kth largest element in an unsorted array. Note that it is the kth largest element in the sorted order, not the kth distinct element.For example,Given [3,2,1,5,6,4] and

2017-03-09 16:29:02 247

原创 241. Different Ways to Add Parentheses （算法第二周）

Description：Given a string of numbers and operators, return all possible results from computing all the different possible ways to group numbers and operators. The valid operators are +, - and *

2017-03-04 20:03:53 373

原创 503. Next Greater Element II

Description：Given a circular array (the next element of the last element is the first element of the array), print the Next Greater Number for every element. The Next Greater Number of a number

2017-03-02 00:24:37 232

原创 496. Next Greater Element I

Description：You are given two arrays (without duplicates) nums1 and nums2 where nums1’s elements are subset of nums2. Find all the next greater numbers for nums1's elements in the correspondin

2017-02-24 21:39:13 159

Evolraelc的博客