实习
文章平均质量分 73
Li_Yolanda
这个作者很懒,什么都没留下…
展开
-
记阿里电面一试-研发类c++
找到内推投了阿里的简历,过了素质测评和在线测试之后第一次电面经历。原创 2017-03-30 21:23:17 · 476 阅读 · 0 评论 -
LeetCode-419. Battleships in a Board
Given an 2D board, count how many battleships are in it. The battleships are represented with 'X's, empty slots are represented with '.'s. You may assume the following rules: You receive a valid原创 2017-04-16 20:54:53 · 286 阅读 · 0 评论 -
LeetCode-138. 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. Hash Table /** * Definitio原创 2017-04-16 20:41:13 · 273 阅读 · 0 评论 -
LeetCode-94(Binary Tree Inorder Traversal)
Given a binary tree, return the inorder traversal of its nodes' values. For example: Given binary tree [1,null,2,3], 1 \ 2 / 3 return [1,3,2]. Note: Recursive solu原创 2017-04-03 16:09:46 · 210 阅读 · 0 评论 -
LeetCode-6(ZigZag Conversion)
The string "PAYPALISHIRING" is written in a zigzag pattern on a given number of rows like this: (you may want to display this pattern in a fixed font for better legibility) P A H N A P L S I原创 2017-04-03 10:47:12 · 338 阅读 · 0 评论 -
LeetCode-10(回文检测)
Determine whether an integer is a palindrome. Do this without extra space. class Solution { public: bool isPalindrome(int x) { if(x<0 || (x!=0 && x%10==0)) return false; //个位是0肯定不是回原创 2017-04-03 15:42:11 · 344 阅读 · 0 评论 -
LeetCode-8(String to Integer (atoi))
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 ca原创 2017-04-03 15:30:02 · 255 阅读 · 0 评论 -
LeetCode-5*(回文)
Given a string s, find the longest palindromic substring in s. You may assume that the maximum length of s is 1000. Example: Input: "babad" Output: "bab" Note: "aba" is also a valid answer.原创 2017-04-03 10:02:56 · 279 阅读 · 0 评论 -
leetcode-2
You are given two non-empty linked lists representing two non-negative integers. The digits are stored in reverse order and each of their nodes contain a single digit. Add the two numbers and return i原创 2017-04-02 09:27:08 · 339 阅读 · 0 评论 -
leetcode-1
Given an array of integers, return indices of the two numbers such that they add up to a specific target. You may assume that each input would have exactly one solution, and you may not use the sam原创 2017-04-02 08:55:15 · 240 阅读 · 0 评论 -
leetcode-24
Given a linked list, swap every two adjacent nodes and return its head. For example, Given 1->2->3->4, you should return the list as 2->1->4->3. Your algorithm should use only constant space. Y原创 2017-04-02 08:46:19 · 238 阅读 · 0 评论 -
LeetCode-273. Integer to English Words
Convert a non-negative integer to its english words representation. Given input is guaranteed to be less than 231 - 1. For example, 123 -> "One Hundred Twenty Three" 12345 -> "Twelve Thousand Thre原创 2017-04-16 21:44:07 · 284 阅读 · 0 评论