Wayne2019的博客

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 dupli

Escape The Ghosts""""""class Solution {public: int distance(vector<int>& s1, vector<int>& s2){ return abs(s1[0]-s2[0])+abs(s1[1]-s2[1]); } bool escapeGho..

Reverse Vowels of a String """"""class Solution {public: bool isVowel(char a){ if(a=='a'||a=='e'||a=='i'||a=='o'||a=='u') return true; if(a=='A'||a=='E'||a=='...

Find Mode in Binary Search Tree"""二叉树的递归，迭代中序遍历。Morris 遍历： https://www.zhihu.com/question/21556707"""Base 7""""""class Solution {public: string convertToBase7(int num) {

Nth Digit"""蛋疼，老Time Limit Exceeded，结果最后是两个long的地方越界"""class Solution {public: int findNthDigit(int n) { /* i=1: 1,...,9: 9 num_i i=2: 10,...,99: 90 ...

Assign Cookies"""简单"""class Solution {public: int findContentChildren(vector<int>& g, vector<int>& s) { sort(g.begin(), g.end()); sort(s.begin(), s.end()..

Subtree of Another Treeclass Solution {public: bool isSame(TreeNode* s, TreeNode* t){ if(!s && !t) return true; if(s && t) return (s-&g...

Second Minimum Node In a Binary Tree/** * Definition for a binary tree node. * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) : val(x), l...

Count Binary Substrings"""简单，但是需要判断啥时候计数“清零”"""class Solution {public: int countBinarySubstrings(string s) { if(s.size()<=1) return 0; int zero = 0, one = 0, ...

Longest Substring Without Repeating Characters""""""class Solution {public: int lengthOfLongestSubstring(string s) { unordered_map<char,int> map; int i=0, j=0, ans=0, ...

Lowest Common Ancestor of a Binary Search Tree"""递归解法，想好边界条件，简单"""/** * Definition for a binary tree node. * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * ...

Contains Duplicate"""简单O(n), O(n)"""class Solution {public: bool containsDuplicate(vector<int>& nums) { unordered_map<int,int> map; for (int i=0; i<nums...

cs231n推荐的starting point:optimizer = tf.train.AdamOptimizer( learning_rate=0.001, #or 5e-4 beta1=0.9,

Remove Duplicates from Sorted List Given a sorted linked list, delete all duplicates such that each element appear only once."""9ms, beats 55.59%time O(n), space O(1)"""/** * Definition for sing

Reverse Integer Given a 32-bit signed integer, reverse digits of an integer."""1. 26 ms时间复杂度是O（log10(n)）"""class Solution {public: int reverse(int x) { int result = 0; int new_

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)."""基本想法是队列实现BF

Longest Common Prefix Write a function to find the longest common prefix string amongst an array of strings.直观的想法是弄个while(true)循环，然后遍历array，每遍历一次取出来一个字符，直到取出来的字符不是共有的为止（后面会看到这种其实是最好的，避免了很多重复计算）。也可以不要每

Merge Two Sorted Lists/** * Definition for singly-linked list. * struct ListNode { * int val; * ListNode *next; * ListNode(int x) : val(x), next(NULL) {} //C++11初始化列表 * }; */先自己想一下。同

Plus One Given a non-negative integer represented as a non-empty array of digits, plus one to the integer."""3 ms, beats 7.49%time: O(n)space: O(n), 也可以改进到O(1), 比如位数变化时直接在vector开头插入一个1也行。"""c

Best Time to Buy and Sell Stock"""扫描，time n, space 19 ms, beats 10.54%"""class Solution {public: int maxProfit(vectorint>& prices) { int small_id = 0; int value = 0;

Rotate Array"""Cyclic Replacements，这个思路还是挺难写对的==O(n)"""class Solution {public: void rotate(vectorint>& nums, int k) { int current = 0; int next; int buffer, buffer_

Letter Combinations of a Phone Number"""这种题就是DFS，递归+一堆传引用。迭代解法见http://www.cnblogs.com/grandyang/p/4452220.html，也可以用队列实现。"""class Solution {public: void helper(const string& digits, vecto...