一步一脚印

原创 华为笔试（软件篇）2018/10/24

1.输入一个字符串，输出个数最多的字符以及个数。若有存在多个个数最多的字符，输出字符串中第一个出现的。inputStr=input()countList=[0]*26for i in inputStr:    countList[int(ord(i)-ord('a'))]=countList[int(ord(i)-ord('a'))]+1maxCount=max(countList)...

原创 stacked_hourglass_model_visualization stacked hourglass模型可视化

原创 读论文 CVPR_2017_Scene-Text-Detection Method Robust against Orientation and Discontiguous Components of

写在前面：本文只为了自己日后忘记时，温习巩固用，本人没有做出任何见解，纯属方便回顾阅读。--------------------------------------------------------------------------------------------------------------------------------------原文标题

原创 读论文 CVPR_2017_DMPNet

写在前面：本文只为了自己日后忘记时，温习巩固用，本人没有做出任何见解，纯属方便回顾阅读。--------------------------------------------------------------------------------------------------------------------------------------------------------

原创 TensorFlow在MNIST数据集上实现神经网络

# -*- coding: utf-8 -*-import tensorflow as tftf.reset_default_graph()INPUT_NODE=784LAYER1_NODE=500OUTPUT_NODE=10def get_weight_variable(shape,regularizer=None): weights=tf.get_variable("we

原创 读论文 CVPR_2017_EAST

写在前面：本文只为了自己日后忘记时，温习巩固用，本人没有做出任何见解，纯属方便回顾阅读。----------------------------------------------------------------------------------------------------------------------------------------------------------

原创 实现简单的神经网络

import tensorflow as tffrom numpy.random import RandomStatebatch_size=8w1=tf.Variable(tf.random_normal([2,3],stddev=1,seed=1))w2=tf.Variable(tf.random_normal([3,1],stddev=1,seed=1))x=tf.place

原创 Windows环境下（64bit,内存4G）,安装虚拟机（VM12.5），Ubuntu（17.04），anaconda（Python3.6）和TensorFlow(1.3)

以Windows7环境下为例，先在360软件管家里下载了一个“VMware Workstation 64位_12.5.7.0”。（当然也可以在网上搜索其他版本的虚拟机。使用360软件管家纯粹为了方便）然后在Ubuntu官网下载镜像文件，当时我下载的是最新版本的ubuntu 17.04。（下载链接：http://mirrors.tuna.tsinghua.edu.cn/ubuntu-releas

原创 Easy-50

leetcode        541. Reverse String II           Given a string and an integer k, you need to reverse the first k characters for every 2k characters counting from the start of the string. If there a

原创 Easy-49

leetcode         551. Student Attendance Record I           You are given a string representing an attendance record for a student. The record only contains the following three characters:

原创 Easy-48

leetcode      268. Missing Number           Given an array containing n distinct numbers taken from 0, 1, 2, ..., n, find the one that is missing from the array.For example,Given nums = [0, 1,

原创 Easy-47

leetcode       447. Number of Boomerangs          Given n points in the plane that are all pairwise distinct, a "boomerang" is a tuple of points(i, j, k) such that the distance between i and j e

原创 Easy-46

leetcode        350. Intersection of Two Arrays II      Given two arrays, write a function to compute their intersection. Example:Given nums1 = [1, 2, 2, 1], nums2 = [2, 2], return[2, 2]. No

原创 Easy-45

leetcode       206. Reverse Linked List        Reverse a singly linked list.   无头节点AC:/** * Definition for singly-linked list. * struct ListNode { *     int val; *     stru

原创 Easy-44

leetcode       401. Binary Watch           A binary watch has 4 LEDs on the top which represent the hours (0-11), and the 6 LEDs on the bottom represent theminutes (0-59).Each LED represents a

原创 Easy-43

leetcode   13. Roman to Integer          Given a roman numeral, convert it to an integer.Input is guaranteed to be within the range from 1 to 3999.AC:int trans(char a){    int add;   

原创 Easy-42

leetcode    217. Contains DuplicateGiven an array of integers, find if the array contains any duplicates. Your function should return true if any value appears at least twice in the array, and it sh

原创 Easy-41

leetcode    409. Longest PalindromeGiven a string which consists of lowercase or uppercase letters, find the length of the longest palindromes that can be built with those letters.This is case s

原创 Easy-40

leetcode      504. Base 7   Given an integer, return its base 7 string representation.Example 1:Input: 100Output: "202"Example 2:Input: -7Output: "-10"Note: The input

原创 Easy-39

leetcode  242. Valid AnagramGiven two strings s and t, write a function to determine if t is an anagram of s.For example,s = "anagram", t = "nagaram", return true.s = "rat", t = "car", ret

原创 Easy-38

leetcode    169. Majority Element          Given an array of size n, find the majority element. The majority element is the element that appearsmore than ⌊ n/2 ⌋ times.You may assume that the

原创 Easy-37

leetcode    100. Same Tree           Given two binary trees, write a function to check if they are equal or not. Two binary trees are considered equal if they are structurally identical and the no

原创 Easy-36

leetcode   237. Delete Node in a Linked ListWrite a function to delete a node (except the tail) in a singly linked list, given only access to that node.Supposed the linked list is 1 -> 2 -> 3 ->

原创 Easy-35

leetcode     171. Excel Sheet Column Number           Related to question Excel Sheet Column TitleGiven a column title as appear in an Excel sheet, return its corresponding column number.For

原创 Easy-34

leetcode       122. Best Time to Buy and Sell Stock II           Say you have an array for which the ith element is the price of a given stock on dayi.Design an algorithm to find the maximum p

原创 Easy-33

leetcode   387. First Unique Character in a StringGiven a string, find the first non-repeating character in it and return it's index. If it doesn't exist, return -1.Examples: s = "leetcode"re

原创 Easy-32

leetcode  404. Sum of Left Leaves           Find the sum of all left leaves in a given binary tree.Example: 3 / \ 9 20 / \ 15 7There are two left leaves in the binary tre

原创 Easy-31

leetcode     383. Ransom Note           Given an arbitrary ransom note string and another string containing letters from all the magazines, write a function that will return true if the ransom note

原创 Easy-30

leetcode  349. Intersection of Two Arrays           Given two arrays, write a function to compute their intersection. Example:Given nums1 = [1, 2, 2, 1], nums2 = [2, 2], return[2]. Note:

原创 Easy-29

leetcode    453. Minimum Moves to Equal Array Elements           Given a non-empty integer array of size n, find the minimum number of moves required to make all array elements equal, where a move

原创 Easy-28

leetcode   455. Assign Cookies           Assume you are an awesome parent and want to give your children some cookies. But, you should give each child at most one cookie. Each child i has a greed fa

原创 Easy-27

leetcode  167. Two Sum II - Input array is sorted           Given an array of integers that is already sorted in ascending order, find two numbers such that they add up to a specific target number

原创 Easy-26

leetcode   506. Relative Ranks           Given scores of N athletes, find their relative ranks and the people with the top three highest scores, who will be awarded medals: "Gold Medal", "Silver Med

原创 Easy-25

leetcode   530. Minimum Absolute Difference in BST           Given a binary search tree with non-negative values, find the minimum absolute difference between values of any two nodes.Example:

原创 Easy-24

leetcode    563. Binary Tree Tilt           Given a binary tree, return the tilt of the whole tree.The tilt of a tree node is defined as the absolute difference between the sum of all left subtr

原创 Easy-23

leetcode   492. Construct the Rectangle           For a web developer, it is very important to know how to design a web page's size. So, given a specific rectangular web page’s area, your job by now

原创 Easy-22

leetcode   283. Move Zeroes          Given an array nums, write a function to move all 0's to the end of it while maintaining the relative order of the non-zero elements.For example, given nums

原创 Easy-21

leetcode   258. Add Digits           Given a non-negative integer num, repeatedly add all its digits until the result has only one digit.For example: Given num = 38, the process is like: 3 + 8

原创 Easy-20

leetcode   226. Invert Binary TreeInvert a binary tree. 4 / \ 2 7 / \ / \1 3 6 9to 4 / \ 7 2 / \ / \9 6 3 1AC;/** * Definition fo

原创 Easy-19

leetcodeCalculate the sum of two integers a and b, but you are not allowed to use the operator + and -.Example:Given a = 1 and b = 2, return 3. AC:int getSum(int a, int b) {    int res