• 谷歌API(Ajax)


    key:ABQIAAAA8p3Bx0AYyZ4oRR6imyISPhTGleYHxCr9_m_RTspoaQwhWklirxT5vY9w1t2JVd3Zq_Lp5EZcFtSC1g

     <!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Strict//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-strict.dtd">
    <html xmlns="http://www.w3.org/1999/xhtml">
      <head>
        <title>My Google API Application</title>
        <script src="https://www.google.com/jsapi?key=ABQIAAAA8p3Bx0AYyZ4oRR6imyISPhTGleYHxCr9_m_RTspoaQwhWklirxT5vY9w1t2JVd3Zq_Lp5EZcFtSC1g" type="text/javascript"></script>
        <script language="Javascript" type="text/javascript">
        //<![CDATA[

        google.load("search", "1");

        function OnLoad() {
          // Create a search control
          var searchControl = new google.search.SearchControl();

          // Add in a full set of searchers
          var localSearch = new google.search.LocalSearch();
          searchControl.addSearcher(localSearch);
          searchControl.addSearcher(new google.search.WebSearch());

          searchControl.addSearcher(new google.search.ImageSearch());
          searchControl.addSearcher(new google.search.VideoSearch());
          searchControl.addSearcher(new google.search.BlogSearch());

          // Set the Local Search center point
          localSearch.setCenterPoint("New York, NY");

          // Tell the searcher to draw itself and tell it where to attach
          searchControl.draw(document.getElementById("searchcontrol"));

          // Execute an inital search
          searchControl.execute("Google");
        }
        google.setOnLoadCallback(OnLoad);

        //]]>
        </script>
      </head>
      <body>
        <div id="searchcontrol">Loading...</div>
      </body>
    </html>

  • 相关阅读:
    Bellman-Ford(BF)和Floyd算法
    Dijkstra实现最短路径
    【图论】连通分量个数(并查集)
    【模拟】n a^o7 !
    【图论】最小生成树
    【搜索DFS】图的深度遍历(dfs)
    【搜索BFS】poj3278--Catch That Cow(bfs)
    【图论】判断给定图是否存在合法拓扑序列
    二叉排序树
    【树】判断给定森林中有多少棵树(简单做法)
  • 原文地址:https://www.cnblogs.com/dashi/p/4034755.html
Copyright © 2020-2023  润新知